./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E --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.3.0-dev-826ab2b [2024-11-14 05:44:05,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:44:05,938 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 05:44:05,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:44:05,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:44:06,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:44:06,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:44:06,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:44:06,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:44:06,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:44:06,003 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:44:06,004 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:44:06,004 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:44:06,005 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:44:06,005 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:44:06,005 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:44:06,005 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:44:06,007 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:44:06,007 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:44:06,008 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:44:06,008 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:44:06,008 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:44:06,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 05:44:06,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:44:06,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:44:06,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:44:06,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:44:06,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:44:06,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:44:06,013 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:44:06,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:44:06,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:44:06,013 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:44:06,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:44:06,014 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E 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-14 05:44:06,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:44:06,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:44:06,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:44:06,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:44:06,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:44:06,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread/queue_longer.i Unable to find full path for "g++" [2024-11-14 05:44:08,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:44:09,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:44:09,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/sv-benchmarks/c/pthread/queue_longer.i [2024-11-14 05:44:09,402 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/data/6b4937e92/246c4cbcae7c4adf95afb86ae9c39045/FLAGed26ef01d [2024-11-14 05:44:09,429 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/data/6b4937e92/246c4cbcae7c4adf95afb86ae9c39045 [2024-11-14 05:44:09,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:44:09,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:44:09,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:44:09,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:44:09,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:44:09,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:44:09" (1/1) ... [2024-11-14 05:44:09,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0d5eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:09, skipping insertion in model container [2024-11-14 05:44:09,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:44:09" (1/1) ... [2024-11-14 05:44:09,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:44:10,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:44:10,465 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:44:10,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:44:10,754 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:44:10,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10 WrapperNode [2024-11-14 05:44:10,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:44:10,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:44:10,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:44:10,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:44:10,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:10,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:10,953 INFO L138 Inliner]: procedures = 277, calls = 862, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1065 [2024-11-14 05:44:10,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:44:10,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:44:10,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:44:10,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:44:10,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:10,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:10,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:10,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:44:11,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:44:11,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:44:11,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:44:11,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (1/1) ... [2024-11-14 05:44:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:44:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:11,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:44:11,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:44:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 05:44:11,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 05:44:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 05:44:11,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 05:44:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:44:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:44:11,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:44:11,189 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 05:44:11,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:44:11,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:44:13,547 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 05:44:13,547 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:44:23,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:44:23,381 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:44:23,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:44:23 BoogieIcfgContainer [2024-11-14 05:44:23,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:44:23,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:44:23,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:44:23,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:44:23,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:44:09" (1/3) ... [2024-11-14 05:44:23,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:44:23, skipping insertion in model container [2024-11-14 05:44:23,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:44:10" (2/3) ... [2024-11-14 05:44:23,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:44:23, skipping insertion in model container [2024-11-14 05:44:23,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:44:23" (3/3) ... [2024-11-14 05:44:23,398 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-14 05:44:23,422 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:44:23,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2024-11-14 05:44:23,425 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 05:44:23,589 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 05:44:23,637 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 83 transitions, 180 flow [2024-11-14 05:44:23,890 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2041 states, 1951 states have (on average 2.7929267042542287) internal successors, (5449), 2040 states have internal predecessors, (5449), 0 states have call successors, (0), 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-14 05:44:23,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:44:23,951 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;@543a59d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:44:23,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-14 05:44:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 2041 states, 1951 states have (on average 2.7929267042542287) internal successors, (5449), 2040 states have internal predecessors, (5449), 0 states have call successors, (0), 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-14 05:44:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:44:23,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:23,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:44:23,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash -326712067, now seen corresponding path program 1 times [2024-11-14 05:44:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946438383] [2024-11-14 05:44:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:27,293 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-14 05:44:27,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946438383] [2024-11-14 05:44:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946438383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:27,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:44:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025344775] [2024-11-14 05:44:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:27,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:44:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:44:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:44:27,342 INFO L87 Difference]: Start difference. First operand has 2041 states, 1951 states have (on average 2.7929267042542287) internal successors, (5449), 2040 states have internal predecessors, (5449), 0 states have call successors, (0), 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-14 05:44:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:28,396 INFO L93 Difference]: Finished difference Result 2366 states and 6275 transitions. [2024-11-14 05:44:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:44:28,399 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-14 05:44:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:28,463 INFO L225 Difference]: With dead ends: 2366 [2024-11-14 05:44:28,464 INFO L226 Difference]: Without dead ends: 2211 [2024-11-14 05:44:28,472 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-14 05:44:28,480 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:28,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 107 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:44:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2024-11-14 05:44:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2169. [2024-11-14 05:44:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2073 states have (on average 2.7670043415340086) internal successors, (5736), 2168 states have internal predecessors, (5736), 0 states have call successors, (0), 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-14 05:44:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 5736 transitions. [2024-11-14 05:44:28,739 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 5736 transitions. Word has length 6 [2024-11-14 05:44:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:28,740 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 5736 transitions. [2024-11-14 05:44:28,741 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-14 05:44:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 5736 transitions. [2024-11-14 05:44:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:44:28,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:28,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:28,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:44:28,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:28,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1538137123, now seen corresponding path program 1 times [2024-11-14 05:44:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046702268] [2024-11-14 05:44:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:30,857 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-14 05:44:30,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:30,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046702268] [2024-11-14 05:44:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046702268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:30,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:44:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575544221] [2024-11-14 05:44:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:44:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:44:30,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:44:30,862 INFO L87 Difference]: Start difference. First operand 2169 states and 5736 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-14 05:44:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:31,848 INFO L93 Difference]: Finished difference Result 2313 states and 6138 transitions. [2024-11-14 05:44:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:44:31,849 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-14 05:44:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:31,871 INFO L225 Difference]: With dead ends: 2313 [2024-11-14 05:44:31,871 INFO L226 Difference]: Without dead ends: 2267 [2024-11-14 05:44:31,873 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-14 05:44:31,874 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:31,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 118 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:44:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2024-11-14 05:44:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2207. [2024-11-14 05:44:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2111 states have (on average 2.7645665561345334) internal successors, (5836), 2206 states have internal predecessors, (5836), 0 states have call successors, (0), 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-14 05:44:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5836 transitions. [2024-11-14 05:44:32,008 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5836 transitions. Word has length 7 [2024-11-14 05:44:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:32,009 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 5836 transitions. [2024-11-14 05:44:32,009 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-14 05:44:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5836 transitions. [2024-11-14 05:44:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:44:32,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:32,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:32,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:44:32,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:32,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash -680949760, now seen corresponding path program 1 times [2024-11-14 05:44:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:32,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177577382] [2024-11-14 05:44:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:33,682 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-14 05:44:33,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177577382] [2024-11-14 05:44:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177577382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:33,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:33,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:44:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917412285] [2024-11-14 05:44:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:33,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:44:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:44:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:44:33,685 INFO L87 Difference]: Start difference. First operand 2207 states and 5836 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-14 05:44:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:35,037 INFO L93 Difference]: Finished difference Result 2525 states and 6747 transitions. [2024-11-14 05:44:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:44:35,038 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-14 05:44:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:35,062 INFO L225 Difference]: With dead ends: 2525 [2024-11-14 05:44:35,063 INFO L226 Difference]: Without dead ends: 2433 [2024-11-14 05:44:35,065 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-14 05:44:35,066 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:35,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 184 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:44:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2024-11-14 05:44:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2373. [2024-11-14 05:44:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2277 states have (on average 2.7654808959156787) internal successors, (6297), 2372 states have internal predecessors, (6297), 0 states have call successors, (0), 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-14 05:44:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 6297 transitions. [2024-11-14 05:44:35,214 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 6297 transitions. Word has length 9 [2024-11-14 05:44:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:35,215 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 6297 transitions. [2024-11-14 05:44:35,215 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-14 05:44:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 6297 transitions. [2024-11-14 05:44:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:44:35,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:35,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:35,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:44:35,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash 412681522, now seen corresponding path program 1 times [2024-11-14 05:44:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896248427] [2024-11-14 05:44:35,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:35,678 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-14 05:44:35,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:35,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896248427] [2024-11-14 05:44:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896248427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:35,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:44:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973405699] [2024-11-14 05:44:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:35,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:44:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:44:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:44:35,681 INFO L87 Difference]: Start difference. First operand 2373 states and 6297 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:36,440 INFO L93 Difference]: Finished difference Result 4338 states and 11499 transitions. [2024-11-14 05:44:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:44:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:44:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:36,464 INFO L225 Difference]: With dead ends: 4338 [2024-11-14 05:44:36,464 INFO L226 Difference]: Without dead ends: 2260 [2024-11-14 05:44:36,470 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-14 05:44:36,471 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:36,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:44:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2024-11-14 05:44:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2106. [2024-11-14 05:44:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2042 states have (on average 2.7536728697355533) internal successors, (5623), 2105 states have internal predecessors, (5623), 0 states have call successors, (0), 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-14 05:44:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 5623 transitions. [2024-11-14 05:44:36,601 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 5623 transitions. Word has length 10 [2024-11-14 05:44:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 5623 transitions. [2024-11-14 05:44:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 5623 transitions. [2024-11-14 05:44:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:44:36,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:36,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:36,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:44:36,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:36,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1449996981, now seen corresponding path program 1 times [2024-11-14 05:44:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886935658] [2024-11-14 05:44:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:36,986 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-14 05:44:36,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886935658] [2024-11-14 05:44:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886935658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:44:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993833928] [2024-11-14 05:44:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:44:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:36,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:44:36,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:44:36,990 INFO L87 Difference]: Start difference. First operand 2106 states and 5623 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:38,274 INFO L93 Difference]: Finished difference Result 3944 states and 10622 transitions. [2024-11-14 05:44:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:44:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 05:44:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:38,312 INFO L225 Difference]: With dead ends: 3944 [2024-11-14 05:44:38,312 INFO L226 Difference]: Without dead ends: 3708 [2024-11-14 05:44:38,316 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-14 05:44:38,319 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 107 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:38,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 137 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:44:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2024-11-14 05:44:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3496. [2024-11-14 05:44:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3432 states have (on average 2.7753496503496504) internal successors, (9525), 3495 states have internal predecessors, (9525), 0 states have call successors, (0), 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-14 05:44:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 9525 transitions. [2024-11-14 05:44:38,568 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 9525 transitions. Word has length 12 [2024-11-14 05:44:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:38,572 INFO L471 AbstractCegarLoop]: Abstraction has 3496 states and 9525 transitions. [2024-11-14 05:44:38,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 9525 transitions. [2024-11-14 05:44:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:44:38,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:38,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:38,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:44:38,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:38,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -599955158, now seen corresponding path program 1 times [2024-11-14 05:44:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84119924] [2024-11-14 05:44:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:39,770 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-14 05:44:39,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84119924] [2024-11-14 05:44:39,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84119924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:39,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:39,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:44:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745722787] [2024-11-14 05:44:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:39,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:44:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:39,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:44:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:44:39,776 INFO L87 Difference]: Start difference. First operand 3496 states and 9525 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:40,743 INFO L93 Difference]: Finished difference Result 6764 states and 18469 transitions. [2024-11-14 05:44:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:44:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 05:44:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:40,775 INFO L225 Difference]: With dead ends: 6764 [2024-11-14 05:44:40,776 INFO L226 Difference]: Without dead ends: 3606 [2024-11-14 05:44:40,783 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-14 05:44:40,785 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 87 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:40,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 153 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:44:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2024-11-14 05:44:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3496. [2024-11-14 05:44:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3432 states have (on average 2.763111888111888) internal successors, (9483), 3495 states have internal predecessors, (9483), 0 states have call successors, (0), 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-14 05:44:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 9483 transitions. [2024-11-14 05:44:40,941 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 9483 transitions. Word has length 18 [2024-11-14 05:44:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:40,942 INFO L471 AbstractCegarLoop]: Abstraction has 3496 states and 9483 transitions. [2024-11-14 05:44:40,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:44:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 9483 transitions. [2024-11-14 05:44:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:44:40,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:40,944 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] [2024-11-14 05:44:40,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:44:40,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:40,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1752719084, now seen corresponding path program 1 times [2024-11-14 05:44:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823542875] [2024-11-14 05:44:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:44,446 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-14 05:44:44,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823542875] [2024-11-14 05:44:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823542875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:44,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:44:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905179275] [2024-11-14 05:44:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:44:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:44,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:44:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:44:44,451 INFO L87 Difference]: Start difference. First operand 3496 states and 9483 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-14 05:44:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:46,572 INFO L93 Difference]: Finished difference Result 3986 states and 10731 transitions. [2024-11-14 05:44:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:44:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-14 05:44:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:46,597 INFO L225 Difference]: With dead ends: 3986 [2024-11-14 05:44:46,597 INFO L226 Difference]: Without dead ends: 3944 [2024-11-14 05:44:46,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:44:46,600 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 142 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:46,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 435 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:44:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2024-11-14 05:44:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3754. [2024-11-14 05:44:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3754 states, 3690 states have (on average 2.7769647696476967) internal successors, (10247), 3753 states have internal predecessors, (10247), 0 states have call successors, (0), 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-14 05:44:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 10247 transitions. [2024-11-14 05:44:46,762 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 10247 transitions. Word has length 20 [2024-11-14 05:44:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:46,763 INFO L471 AbstractCegarLoop]: Abstraction has 3754 states and 10247 transitions. [2024-11-14 05:44:46,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-14 05:44:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 10247 transitions. [2024-11-14 05:44:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:44:46,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:46,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:44:46,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1045750677, now seen corresponding path program 1 times [2024-11-14 05:44:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:46,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577746010] [2024-11-14 05:44:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:47,091 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-14 05:44:47,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577746010] [2024-11-14 05:44:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577746010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008497500] [2024-11-14 05:44:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:47,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:47,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:44:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:47,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:44:47,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:47,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:44:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008497500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:44:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-14 05:44:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851754004] [2024-11-14 05:44:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:44:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:44:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:44:47,780 INFO L87 Difference]: Start difference. First operand 3754 states and 10247 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-14 05:44:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:48,895 INFO L93 Difference]: Finished difference Result 3754 states and 10247 transitions. [2024-11-14 05:44:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:44:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-14 05:44:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:48,928 INFO L225 Difference]: With dead ends: 3754 [2024-11-14 05:44:48,928 INFO L226 Difference]: Without dead ends: 3655 [2024-11-14 05:44:48,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-14 05:44:48,931 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 154 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:48,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:44:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2024-11-14 05:44:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3655. [2024-11-14 05:44:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3601 states have (on average 2.758400444321022) internal successors, (9933), 3654 states have internal predecessors, (9933), 0 states have call successors, (0), 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-14 05:44:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 9933 transitions. [2024-11-14 05:44:49,094 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 9933 transitions. Word has length 20 [2024-11-14 05:44:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 3655 states and 9933 transitions. [2024-11-14 05:44:49,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-14 05:44:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 9933 transitions. [2024-11-14 05:44:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:44:49,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:49,100 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-14 05:44:49,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:44:49,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:49,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:49,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1500280855, now seen corresponding path program 1 times [2024-11-14 05:44:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:49,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549081946] [2024-11-14 05:44:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:52,928 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-14 05:44:52,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549081946] [2024-11-14 05:44:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549081946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:52,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:44:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394382188] [2024-11-14 05:44:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:52,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:44:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:52,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:44:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:44:52,931 INFO L87 Difference]: Start difference. First operand 3655 states and 9933 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-14 05:44:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:55,012 INFO L93 Difference]: Finished difference Result 3832 states and 10287 transitions. [2024-11-14 05:44:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:44:55,013 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-14 05:44:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:55,038 INFO L225 Difference]: With dead ends: 3832 [2024-11-14 05:44:55,038 INFO L226 Difference]: Without dead ends: 3792 [2024-11-14 05:44:55,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:44:55,042 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 188 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:55,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 278 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:44:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2024-11-14 05:44:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3671. [2024-11-14 05:44:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3617 states have (on average 2.7575338678462815) internal successors, (9974), 3670 states have internal predecessors, (9974), 0 states have call successors, (0), 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-14 05:44:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 9974 transitions. [2024-11-14 05:44:55,203 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 9974 transitions. Word has length 21 [2024-11-14 05:44:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:55,203 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 9974 transitions. [2024-11-14 05:44:55,203 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-14 05:44:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 9974 transitions. [2024-11-14 05:44:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:44:55,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:55,208 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:44:55,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1941469804, now seen corresponding path program 1 times [2024-11-14 05:44:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346446910] [2024-11-14 05:44:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:44:55,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346446910] [2024-11-14 05:44:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346446910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:44:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110543368] [2024-11-14 05:44:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:55,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:44:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:44:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:44:55,422 INFO L87 Difference]: Start difference. First operand 3671 states and 9974 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-14 05:44:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:56,531 INFO L93 Difference]: Finished difference Result 3671 states and 9974 transitions. [2024-11-14 05:44:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:44:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-14 05:44:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:56,557 INFO L225 Difference]: With dead ends: 3671 [2024-11-14 05:44:56,557 INFO L226 Difference]: Without dead ends: 3435 [2024-11-14 05:44:56,560 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-14 05:44:56,561 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 104 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:56,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 124 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:44:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-11-14 05:44:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 2160. [2024-11-14 05:44:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2116 states have (on average 2.6743856332703215) internal successors, (5659), 2159 states have internal predecessors, (5659), 0 states have call successors, (0), 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-14 05:44:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5659 transitions. [2024-11-14 05:44:56,686 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5659 transitions. Word has length 21 [2024-11-14 05:44:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:56,687 INFO L471 AbstractCegarLoop]: Abstraction has 2160 states and 5659 transitions. [2024-11-14 05:44:56,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-14 05:44:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5659 transitions. [2024-11-14 05:44:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:44:56,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:56,691 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-14 05:44:56,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:44:56,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 735904367, now seen corresponding path program 1 times [2024-11-14 05:44:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:56,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951026768] [2024-11-14 05:44:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:56,976 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-14 05:44:56,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951026768] [2024-11-14 05:44:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951026768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:56,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:56,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:44:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062539060] [2024-11-14 05:44:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:56,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:44:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:44:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:44:56,979 INFO L87 Difference]: Start difference. First operand 2160 states and 5659 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-14 05:44:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:57,789 INFO L93 Difference]: Finished difference Result 3012 states and 7881 transitions. [2024-11-14 05:44:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:44:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-14 05:44:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:57,807 INFO L225 Difference]: With dead ends: 3012 [2024-11-14 05:44:57,807 INFO L226 Difference]: Without dead ends: 2832 [2024-11-14 05:44:57,809 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-14 05:44:57,810 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:57,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 90 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:44:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-14 05:44:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2784. [2024-11-14 05:44:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2740 states have (on average 2.671167883211679) internal successors, (7319), 2783 states have internal predecessors, (7319), 0 states have call successors, (0), 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-14 05:44:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 7319 transitions. [2024-11-14 05:44:57,931 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 7319 transitions. Word has length 22 [2024-11-14 05:44:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:57,932 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 7319 transitions. [2024-11-14 05:44:57,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-14 05:44:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 7319 transitions. [2024-11-14 05:44:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:44:57,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:57,934 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-14 05:44:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:44:57,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:44:57,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1339186350, now seen corresponding path program 1 times [2024-11-14 05:44:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390815248] [2024-11-14 05:44:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:59,940 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-14 05:44:59,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390815248] [2024-11-14 05:44:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390815248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:44:59,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:44:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:44:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540594479] [2024-11-14 05:44:59,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:44:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:44:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:44:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:44:59,941 INFO L87 Difference]: Start difference. First operand 2784 states and 7319 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 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-14 05:45:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:01,811 INFO L93 Difference]: Finished difference Result 3000 states and 7844 transitions. [2024-11-14 05:45:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:45:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 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-14 05:45:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:01,826 INFO L225 Difference]: With dead ends: 3000 [2024-11-14 05:45:01,826 INFO L226 Difference]: Without dead ends: 2952 [2024-11-14 05:45:01,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:45:01,828 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 132 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:01,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 341 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:45:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2024-11-14 05:45:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2826. [2024-11-14 05:45:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2782 states have (on average 2.6585190510424157) internal successors, (7396), 2825 states have internal predecessors, (7396), 0 states have call successors, (0), 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-14 05:45:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 7396 transitions. [2024-11-14 05:45:01,951 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 7396 transitions. Word has length 23 [2024-11-14 05:45:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:01,952 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 7396 transitions. [2024-11-14 05:45:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 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-14 05:45:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 7396 transitions. [2024-11-14 05:45:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:45:01,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:01,955 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] [2024-11-14 05:45:01,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:45:01,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:01,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1885717541, now seen corresponding path program 1 times [2024-11-14 05:45:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115298529] [2024-11-14 05:45:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:02,291 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-14 05:45:02,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115298529] [2024-11-14 05:45:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115298529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320263364] [2024-11-14 05:45:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:02,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:02,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:02,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:45:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:02,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:45:02,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:02,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:45:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320263364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:02,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:45:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-14 05:45:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653625040] [2024-11-14 05:45:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:45:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:45:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:45:02,936 INFO L87 Difference]: Start difference. First operand 2826 states and 7396 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:45:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:03,728 INFO L93 Difference]: Finished difference Result 2826 states and 7396 transitions. [2024-11-14 05:45:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:45:03,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 05:45:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:03,747 INFO L225 Difference]: With dead ends: 2826 [2024-11-14 05:45:03,747 INFO L226 Difference]: Without dead ends: 2694 [2024-11-14 05:45:03,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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-14 05:45:03,750 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 99 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:03,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 66 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:45:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2024-11-14 05:45:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694. [2024-11-14 05:45:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2660 states have (on average 2.6466165413533833) internal successors, (7040), 2693 states have internal predecessors, (7040), 0 states have call successors, (0), 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-14 05:45:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 7040 transitions. [2024-11-14 05:45:03,877 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 7040 transitions. Word has length 30 [2024-11-14 05:45:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:03,877 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 7040 transitions. [2024-11-14 05:45:03,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:45:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 7040 transitions. [2024-11-14 05:45:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:45:03,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:03,880 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] [2024-11-14 05:45:03,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:45:04,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 05:45:04,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:04,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1672295978, now seen corresponding path program 1 times [2024-11-14 05:45:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7074094] [2024-11-14 05:45:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:45:04,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7074094] [2024-11-14 05:45:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7074094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:04,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:45:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746789998] [2024-11-14 05:45:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:04,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:45:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:45:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:45:04,302 INFO L87 Difference]: Start difference. First operand 2694 states and 7040 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-14 05:45:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:05,199 INFO L93 Difference]: Finished difference Result 2694 states and 7040 transitions. [2024-11-14 05:45:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:45:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-14 05:45:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:05,216 INFO L225 Difference]: With dead ends: 2694 [2024-11-14 05:45:05,216 INFO L226 Difference]: Without dead ends: 2562 [2024-11-14 05:45:05,218 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-14 05:45:05,219 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 66 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:05,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 73 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:45:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2024-11-14 05:45:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1938. [2024-11-14 05:45:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1914 states have (on average 2.649947753396029) internal successors, (5072), 1937 states have internal predecessors, (5072), 0 states have call successors, (0), 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-14 05:45:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 5072 transitions. [2024-11-14 05:45:05,322 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 5072 transitions. Word has length 31 [2024-11-14 05:45:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:05,323 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 5072 transitions. [2024-11-14 05:45:05,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-14 05:45:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 5072 transitions. [2024-11-14 05:45:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:45:05,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:05,326 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] [2024-11-14 05:45:05,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:45:05,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -830468152, now seen corresponding path program 1 times [2024-11-14 05:45:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275240175] [2024-11-14 05:45:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:05,693 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-14 05:45:05,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275240175] [2024-11-14 05:45:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275240175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:45:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436352439] [2024-11-14 05:45:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:45:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:45:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:45:05,694 INFO L87 Difference]: Start difference. First operand 1938 states and 5072 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-14 05:45:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:06,497 INFO L93 Difference]: Finished difference Result 2947 states and 7714 transitions. [2024-11-14 05:45:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:45:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-14 05:45:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:06,508 INFO L225 Difference]: With dead ends: 2947 [2024-11-14 05:45:06,508 INFO L226 Difference]: Without dead ends: 1350 [2024-11-14 05:45:06,514 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-14 05:45:06,516 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:06,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 34 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:45:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-14 05:45:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1212. [2024-11-14 05:45:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1196 states have (on average 2.4866220735785953) internal successors, (2974), 1211 states have internal predecessors, (2974), 0 states have call successors, (0), 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-14 05:45:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 2974 transitions. [2024-11-14 05:45:06,598 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 2974 transitions. Word has length 33 [2024-11-14 05:45:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 2974 transitions. [2024-11-14 05:45:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-14 05:45:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2974 transitions. [2024-11-14 05:45:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:45:06,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:06,603 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] [2024-11-14 05:45:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:45:06,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1308132432, now seen corresponding path program 1 times [2024-11-14 05:45:06,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599110268] [2024-11-14 05:45:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:08,376 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-14 05:45:08,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599110268] [2024-11-14 05:45:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599110268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:08,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:45:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646885004] [2024-11-14 05:45:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:45:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:45:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:45:08,379 INFO L87 Difference]: Start difference. First operand 1212 states and 2974 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 05:45:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:09,898 INFO L93 Difference]: Finished difference Result 1906 states and 4694 transitions. [2024-11-14 05:45:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:45:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:45:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:09,910 INFO L225 Difference]: With dead ends: 1906 [2024-11-14 05:45:09,914 INFO L226 Difference]: Without dead ends: 1212 [2024-11-14 05:45:09,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:45:09,917 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 133 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:09,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 175 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:45:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-14 05:45:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-14 05:45:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1196 states have (on average 2.471571906354515) internal successors, (2956), 1211 states have internal predecessors, (2956), 0 states have call successors, (0), 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-14 05:45:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 2956 transitions. [2024-11-14 05:45:10,074 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 2956 transitions. Word has length 34 [2024-11-14 05:45:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 2956 transitions. [2024-11-14 05:45:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 05:45:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2956 transitions. [2024-11-14 05:45:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:45:10,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:10,077 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-14 05:45:10,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:45:10,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1088871218, now seen corresponding path program 1 times [2024-11-14 05:45:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184129686] [2024-11-14 05:45:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:13,080 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-14 05:45:13,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184129686] [2024-11-14 05:45:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184129686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 05:45:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198534607] [2024-11-14 05:45:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:45:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:45:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:45:13,085 INFO L87 Difference]: Start difference. First operand 1212 states and 2956 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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-14 05:45:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:15,747 INFO L93 Difference]: Finished difference Result 1549 states and 3788 transitions. [2024-11-14 05:45:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:45:15,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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-14 05:45:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:15,754 INFO L225 Difference]: With dead ends: 1549 [2024-11-14 05:45:15,754 INFO L226 Difference]: Without dead ends: 1534 [2024-11-14 05:45:15,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:45:15,756 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 229 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:15,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 307 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-14 05:45:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-14 05:45:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1482. [2024-11-14 05:45:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1466 states have (on average 2.4884038199181444) internal successors, (3648), 1481 states have internal predecessors, (3648), 0 states have call successors, (0), 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-14 05:45:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 3648 transitions. [2024-11-14 05:45:15,860 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 3648 transitions. Word has length 36 [2024-11-14 05:45:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 3648 transitions. [2024-11-14 05:45:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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-14 05:45:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 3648 transitions. [2024-11-14 05:45:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:45:15,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:15,864 INFO L215 NwaCegarLoop]: trace histogram [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-14 05:45:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:45:15,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1092148999, now seen corresponding path program 1 times [2024-11-14 05:45:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659538450] [2024-11-14 05:45:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:16,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659538450] [2024-11-14 05:45:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659538450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:45:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986206836] [2024-11-14 05:45:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:45:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:45:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:45:16,179 INFO L87 Difference]: Start difference. First operand 1482 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-14 05:45:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:16,831 INFO L93 Difference]: Finished difference Result 2063 states and 5080 transitions. [2024-11-14 05:45:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:45:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-14 05:45:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:16,836 INFO L225 Difference]: With dead ends: 2063 [2024-11-14 05:45:16,836 INFO L226 Difference]: Without dead ends: 1295 [2024-11-14 05:45:16,837 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-14 05:45:16,838 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:16,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:45:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-14 05:45:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1221. [2024-11-14 05:45:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1205 states have (on average 2.4315352697095434) internal successors, (2930), 1220 states have internal predecessors, (2930), 0 states have call successors, (0), 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-14 05:45:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2930 transitions. [2024-11-14 05:45:16,889 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2930 transitions. Word has length 36 [2024-11-14 05:45:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:16,889 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 2930 transitions. [2024-11-14 05:45:16,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-14 05:45:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2930 transitions. [2024-11-14 05:45:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:45:16,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:16,891 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] [2024-11-14 05:45:16,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:45:16,892 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash -604728193, now seen corresponding path program 1 times [2024-11-14 05:45:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950332465] [2024-11-14 05:45:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:17,885 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-14 05:45:17,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950332465] [2024-11-14 05:45:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950332465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:45:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131698166] [2024-11-14 05:45:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:45:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:45:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:45:17,887 INFO L87 Difference]: Start difference. First operand 1221 states and 2930 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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-14 05:45:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:18,855 INFO L93 Difference]: Finished difference Result 1221 states and 2930 transitions. [2024-11-14 05:45:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:45:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 05:45:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:18,860 INFO L225 Difference]: With dead ends: 1221 [2024-11-14 05:45:18,860 INFO L226 Difference]: Without dead ends: 1206 [2024-11-14 05:45:18,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:45:18,861 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 150 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:18,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 81 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:45:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-11-14 05:45:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2024-11-14 05:45:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1192 states have (on average 2.428691275167785) internal successors, (2895), 1205 states have internal predecessors, (2895), 0 states have call successors, (0), 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-14 05:45:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2895 transitions. [2024-11-14 05:45:18,942 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2895 transitions. Word has length 37 [2024-11-14 05:45:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 2895 transitions. [2024-11-14 05:45:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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-14 05:45:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2895 transitions. [2024-11-14 05:45:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:45:18,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:18,945 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-14 05:45:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:45:18,946 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1323131068, now seen corresponding path program 1 times [2024-11-14 05:45:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810474044] [2024-11-14 05:45:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:23,111 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-14 05:45:23,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:23,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810474044] [2024-11-14 05:45:23,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810474044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:23,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:23,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:45:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634366103] [2024-11-14 05:45:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:45:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:45:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:45:23,113 INFO L87 Difference]: Start difference. First operand 1206 states and 2895 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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-14 05:45:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:24,660 INFO L93 Difference]: Finished difference Result 1490 states and 3583 transitions. [2024-11-14 05:45:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:45:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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-14 05:45:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:24,668 INFO L225 Difference]: With dead ends: 1490 [2024-11-14 05:45:24,669 INFO L226 Difference]: Without dead ends: 1475 [2024-11-14 05:45:24,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:45:24,670 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 209 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:24,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 192 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:45:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-11-14 05:45:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1251. [2024-11-14 05:45:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1237 states have (on average 2.433306386418755) internal successors, (3010), 1250 states have internal predecessors, (3010), 0 states have call successors, (0), 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-14 05:45:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 3010 transitions. [2024-11-14 05:45:24,750 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 3010 transitions. Word has length 39 [2024-11-14 05:45:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:24,750 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 3010 transitions. [2024-11-14 05:45:24,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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-14 05:45:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 3010 transitions. [2024-11-14 05:45:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 05:45:24,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:24,753 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] [2024-11-14 05:45:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 05:45:24,753 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1932612280, now seen corresponding path program 1 times [2024-11-14 05:45:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646813761] [2024-11-14 05:45:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:28,666 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-14 05:45:28,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646813761] [2024-11-14 05:45:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646813761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:45:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486527796] [2024-11-14 05:45:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:28,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:45:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:45:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:45:28,668 INFO L87 Difference]: Start difference. First operand 1251 states and 3010 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-14 05:45:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:30,906 INFO L93 Difference]: Finished difference Result 1291 states and 3098 transitions. [2024-11-14 05:45:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:45:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-14 05:45:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:30,914 INFO L225 Difference]: With dead ends: 1291 [2024-11-14 05:45:30,915 INFO L226 Difference]: Without dead ends: 1202 [2024-11-14 05:45:30,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:45:30,918 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:30,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 239 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 05:45:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-14 05:45:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1192. [2024-11-14 05:45:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1178 states have (on average 2.431239388794567) internal successors, (2864), 1191 states have internal predecessors, (2864), 0 states have call successors, (0), 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-14 05:45:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2864 transitions. [2024-11-14 05:45:31,009 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2864 transitions. Word has length 40 [2024-11-14 05:45:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:31,009 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 2864 transitions. [2024-11-14 05:45:31,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-14 05:45:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2864 transitions. [2024-11-14 05:45:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 05:45:31,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:31,012 INFO L215 NwaCegarLoop]: trace histogram [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-14 05:45:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 05:45:31,013 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1736999073, now seen corresponding path program 1 times [2024-11-14 05:45:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16263407] [2024-11-14 05:45:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:34,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16263407] [2024-11-14 05:45:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16263407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:34,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:34,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:45:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584711057] [2024-11-14 05:45:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:45:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:34,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:45:34,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:45:34,234 INFO L87 Difference]: Start difference. First operand 1192 states and 2864 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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-14 05:45:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:36,731 INFO L93 Difference]: Finished difference Result 1736 states and 4190 transitions. [2024-11-14 05:45:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:45:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-14 05:45:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:36,738 INFO L225 Difference]: With dead ends: 1736 [2024-11-14 05:45:36,738 INFO L226 Difference]: Without dead ends: 1192 [2024-11-14 05:45:36,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:45:36,742 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 169 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:36,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 244 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 05:45:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-14 05:45:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-11-14 05:45:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1178 states have (on average 2.422750424448217) internal successors, (2854), 1191 states have internal predecessors, (2854), 0 states have call successors, (0), 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-14 05:45:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2854 transitions. [2024-11-14 05:45:36,803 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2854 transitions. Word has length 48 [2024-11-14 05:45:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:36,803 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 2854 transitions. [2024-11-14 05:45:36,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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-14 05:45:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2854 transitions. [2024-11-14 05:45:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 05:45:36,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:36,805 INFO L215 NwaCegarLoop]: trace histogram [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-14 05:45:36,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 05:45:36,806 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:36,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1126962237, now seen corresponding path program 1 times [2024-11-14 05:45:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:36,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553763961] [2024-11-14 05:45:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:45:37,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553763961] [2024-11-14 05:45:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553763961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:45:37,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:45:37,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:45:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389033721] [2024-11-14 05:45:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:45:37,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:45:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:45:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:45:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:45:37,830 INFO L87 Difference]: Start difference. First operand 1192 states and 2854 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:45:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:38,862 INFO L93 Difference]: Finished difference Result 1222 states and 2923 transitions. [2024-11-14 05:45:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:45:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-14 05:45:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:38,866 INFO L225 Difference]: With dead ends: 1222 [2024-11-14 05:45:38,867 INFO L226 Difference]: Without dead ends: 1210 [2024-11-14 05:45:38,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:45:38,868 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:38,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 136 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:45:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-14 05:45:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1180. [2024-11-14 05:45:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1168 states have (on average 2.4195205479452055) internal successors, (2826), 1179 states have internal predecessors, (2826), 0 states have call successors, (0), 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-14 05:45:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2826 transitions. [2024-11-14 05:45:38,929 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2826 transitions. Word has length 50 [2024-11-14 05:45:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:38,929 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 2826 transitions. [2024-11-14 05:45:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:45:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2826 transitions. [2024-11-14 05:45:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 05:45:38,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:38,931 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-14 05:45:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 05:45:38,932 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:45:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -576088590, now seen corresponding path program 1 times [2024-11-14 05:45:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607409566] [2024-11-14 05:45:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:43,836 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-14 05:45:43,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607409566] [2024-11-14 05:45:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607409566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373953253] [2024-11-14 05:45:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:43,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:43,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:43,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:45:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:44,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-14 05:45:44,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:44,816 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 32 treesize of output 16 [2024-11-14 05:45:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:44,877 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 19 treesize of output 14 [2024-11-14 05:45:44,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:45,009 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:45:45,010 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 46 treesize of output 36 [2024-11-14 05:45:45,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,126 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 14 [2024-11-14 05:45:45,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:45,349 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 41 treesize of output 28 [2024-11-14 05:45:45,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:45,459 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 28 treesize of output 21 [2024-11-14 05:45:45,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:45,759 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 56 treesize of output 28 [2024-11-14 05:45:45,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:45,916 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 39 treesize of output 26 [2024-11-14 05:45:46,030 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 42 treesize of output 34 [2024-11-14 05:45:46,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:46,038 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 44 treesize of output 24 [2024-11-14 05:45:46,081 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-14 05:45:46,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:45:47,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1587 Int) (v_ArrVal_1589 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| 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_1585) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1587) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1589) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1587 1))))) is different from false [2024-11-14 05:45:47,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1587 Int) (v_ArrVal_1589 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (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_1585) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1587) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1589) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1587 1))))) is different from false [2024-11-14 05:45:47,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1587 Int) (v_ArrVal_1589 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (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_1582) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1585) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1587 1)) (< 2147483647 v_ArrVal_1582) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1587) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1589) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647)))) is different from false [2024-11-14 05:45:49,070 INFO L349 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2024-11-14 05:45:49,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 772 treesize of output 439 [2024-11-14 05:45:49,253 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-14 05:45:49,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 273 treesize of output 253 [2024-11-14 05:45:49,368 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 05:45:49,370 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 252 treesize of output 224 [2024-11-14 05:45:49,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:49,435 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 234 treesize of output 226 [2024-11-14 05:45:49,467 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 207 treesize of output 183 [2024-11-14 05:45:49,560 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 12 treesize of output 8 [2024-11-14 05:45:49,650 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 12 treesize of output 8 [2024-11-14 05:45:49,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:49,734 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 57 treesize of output 45 [2024-11-14 05:45:50,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:50,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:50,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 380 treesize of output 382 [2024-11-14 05:45:54,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:45:54,513 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 2199 treesize of output 2063 [2024-11-14 05:46:16,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:16,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 10145 treesize of output 6664 [2024-11-14 05:46:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 05:46:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373953253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:46:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385099535] [2024-11-14 05:46:22,901 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:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) 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-14 05:46:22,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:46:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2024-11-14 05:46:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142240495] [2024-11-14 05:46:22,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:46:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:46:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:46:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1348, Unknown=4, NotChecked=234, Total=1806 [2024-11-14 05:46:22,906 INFO L87 Difference]: Start difference. First operand 1180 states and 2826 transitions. Second operand has 43 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 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-14 05:46:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:46:31,530 INFO L93 Difference]: Finished difference Result 2143 states and 5217 transitions. [2024-11-14 05:46:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 05:46:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 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-14 05:46:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:46:31,537 INFO L225 Difference]: With dead ends: 2143 [2024-11-14 05:46:31,537 INFO L226 Difference]: Without dead ends: 1609 [2024-11-14 05:46:31,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=881, Invalid=3683, Unknown=4, NotChecked=402, Total=4970 [2024-11-14 05:46:31,540 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1578 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 972 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:46:31,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 596 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1711 Invalid, 0 Unknown, 972 Unchecked, 5.5s Time] [2024-11-14 05:46:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-11-14 05:46:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1362. [2024-11-14 05:46:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1352 states have (on average 2.426775147928994) internal successors, (3281), 1361 states have internal predecessors, (3281), 0 states have call successors, (0), 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-14 05:46:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 3281 transitions. [2024-11-14 05:46:31,625 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 3281 transitions. Word has length 51 [2024-11-14 05:46:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:46:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 3281 transitions. [2024-11-14 05:46:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 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-14 05:46:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 3281 transitions. [2024-11-14 05:46:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 05:46:31,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:31,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:46:31,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:46:31,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 05:46:31,828 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:46:31,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 429722743, now seen corresponding path program 1 times [2024-11-14 05:46:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903633045] [2024-11-14 05:46:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:35,426 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-14 05:46:35,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:46:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903633045] [2024-11-14 05:46:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903633045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:46:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546344140] [2024-11-14 05:46:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:35,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:46:35,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:46:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:36,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:46:36,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:46:36,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2024-11-14 05:46:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:36,571 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-14 05:46:36,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:36,743 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 41 treesize of output 19 [2024-11-14 05:46:36,816 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 41 treesize of output 19 [2024-11-14 05:46:36,876 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:46:36,877 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 57 treesize of output 41 [2024-11-14 05:46:36,934 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 41 treesize of output 19 [2024-11-14 05:46:36,946 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 13 [2024-11-14 05:46:36,976 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-14 05:46:36,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:37,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (v_ArrVal_1800 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1800) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|)) .cse1))))) is different from false [2024-11-14 05:46:37,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:37,698 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 2 case distinctions, treesize of input 87 treesize of output 51 [2024-11-14 05:46:37,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:37,714 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 74 treesize of output 74 [2024-11-14 05:46:37,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-14 05:46:37,751 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 17 treesize of output 9 [2024-11-14 05:46:37,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:37,788 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 59 treesize of output 47 [2024-11-14 05:46:37,993 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-14 05:46:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546344140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:46:37,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567173135] [2024-11-14 05:46:37,995 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:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) 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-14 05:46:37,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:46:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2024-11-14 05:46:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142728741] [2024-11-14 05:46:37,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:46:37,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:46:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:46:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=846, Unknown=8, NotChecked=60, Total=1056 [2024-11-14 05:46:38,001 INFO L87 Difference]: Start difference. First operand 1362 states and 3281 transitions. Second operand has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 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-14 05:46:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:46:43,406 INFO L93 Difference]: Finished difference Result 2376 states and 5796 transitions. [2024-11-14 05:46:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:46:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 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 53 [2024-11-14 05:46:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:46:43,413 INFO L225 Difference]: With dead ends: 2376 [2024-11-14 05:46:43,413 INFO L226 Difference]: Without dead ends: 1806 [2024-11-14 05:46:43,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=387, Invalid=1771, Unknown=8, NotChecked=90, Total=2256 [2024-11-14 05:46:43,416 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 617 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:46:43,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 587 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1346 Invalid, 0 Unknown, 206 Unchecked, 4.3s Time] [2024-11-14 05:46:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-14 05:46:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1516. [2024-11-14 05:46:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1508 states have (on average 2.456233421750663) internal successors, (3704), 1515 states have internal predecessors, (3704), 0 states have call successors, (0), 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-14 05:46:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3704 transitions. [2024-11-14 05:46:43,523 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3704 transitions. Word has length 53 [2024-11-14 05:46:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:46:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 3704 transitions. [2024-11-14 05:46:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 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-14 05:46:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3704 transitions. [2024-11-14 05:46:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 05:46:43,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:43,525 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-14 05:46:43,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:46:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:43,726 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:46:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -195316144, now seen corresponding path program 1 times [2024-11-14 05:46:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106826531] [2024-11-14 05:46:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:49,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:46:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106826531] [2024-11-14 05:46:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106826531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:46:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030749678] [2024-11-14 05:46:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:49,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:46:49,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:46:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:50,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 2186 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:46:50,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:46:50,729 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-14 05:46:50,862 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-14 05:46:50,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:51,020 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-14 05:46:51,020 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-14 05:46:51,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:51,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:51,267 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2024-11-14 05:46:51,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 89 [2024-11-14 05:46:51,534 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2024-11-14 05:46:51,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 63 [2024-11-14 05:46:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:51,636 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-14 05:46:51,697 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-14 05:46:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:51,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:51,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483648))) is different from false [2024-11-14 05:46:56,662 INFO L349 Elim1Store]: treesize reduction 717, result has 38.9 percent of original size [2024-11-14 05:46:56,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 1139 treesize of output 1111 [2024-11-14 05:46:56,832 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-14 05:46:56,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 588 treesize of output 552 [2024-11-14 05:46:56,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:56,943 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 481 treesize of output 467 [2024-11-14 05:46:56,999 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 165 treesize of output 149 [2024-11-14 05:46:57,071 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 40 treesize of output 32 [2024-11-14 05:46:57,483 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 25 treesize of output 17 [2024-11-14 05:46:57,679 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 25 treesize of output 17 [2024-11-14 05:46:57,826 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 25 treesize of output 17 [2024-11-14 05:46:58,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:58,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 209 [2024-11-14 05:46:58,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:58,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 131 treesize of output 187 [2024-11-14 05:46:59,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:59,104 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 267 treesize of output 295 [2024-11-14 05:46:59,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:59,391 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 118 treesize of output 116 [2024-11-14 05:47:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 7 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 05:47:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030749678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1058403910] [2024-11-14 05:47:05,715 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:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) 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-14 05:47:05,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:47:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 34 [2024-11-14 05:47:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249524415] [2024-11-14 05:47:05,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:47:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:47:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:47:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=991, Unknown=7, NotChecked=66, Total=1260 [2024-11-14 05:47:05,719 INFO L87 Difference]: Start difference. First operand 1516 states and 3704 transitions. Second operand has 36 states, 35 states have (on average 5.485714285714286) internal successors, (192), 35 states have internal predecessors, (192), 0 states have call successors, (0), 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-14 05:47:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:10,987 INFO L93 Difference]: Finished difference Result 1656 states and 4046 transitions. [2024-11-14 05:47:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 05:47:10,988 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.485714285714286) internal successors, (192), 35 states have internal predecessors, (192), 0 states have call successors, (0), 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 66 [2024-11-14 05:47:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:10,994 INFO L225 Difference]: With dead ends: 1656 [2024-11-14 05:47:10,995 INFO L226 Difference]: Without dead ends: 1641 [2024-11-14 05:47:10,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=488, Invalid=2161, Unknown=7, NotChecked=100, Total=2756 [2024-11-14 05:47:10,996 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 861 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:10,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 513 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1305 Invalid, 0 Unknown, 269 Unchecked, 4.0s Time] [2024-11-14 05:47:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2024-11-14 05:47:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1501. [2024-11-14 05:47:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1495 states have (on average 2.4474916387959866) internal successors, (3659), 1500 states have internal predecessors, (3659), 0 states have call successors, (0), 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-14 05:47:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 3659 transitions. [2024-11-14 05:47:11,154 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 3659 transitions. Word has length 66 [2024-11-14 05:47:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:11,154 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 3659 transitions. [2024-11-14 05:47:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.485714285714286) internal successors, (192), 35 states have internal predecessors, (192), 0 states have call successors, (0), 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-14 05:47:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 3659 transitions. [2024-11-14 05:47:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 05:47:11,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:11,157 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] [2024-11-14 05:47:11,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:47:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:11,358 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-14 05:47:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1019840358, now seen corresponding path program 1 times [2024-11-14 05:47:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:47:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230329492] [2024-11-14 05:47:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:47:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:47:13,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:47:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230329492] [2024-11-14 05:47:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230329492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977295392] [2024-11-14 05:47:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:13,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:13,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:13,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22dd81c3-7cff-435c-adad-20199c027a6a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:47:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:14,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 2207 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-14 05:47:14,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:14,307 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-14 05:47:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:14,399 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-14 05:47:14,399 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-14 05:47:14,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,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 38 treesize of output 25 [2024-11-14 05:47:14,559 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-14 05:47:14,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,604 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-14 05:47:14,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:14,743 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-14 05:47:14,743 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-14 05:47:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,800 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-14 05:47:14,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:14,903 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-14 05:47:14,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:14,956 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-14 05:47:15,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,092 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-14 05:47:15,290 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-14 05:47:15,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:15,433 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-14 05:47:15,434 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-14 05:47:15,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,504 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-14 05:47:15,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:15,557 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-14 05:47:15,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:15,604 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-14 05:47:15,685 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-14 05:47:15,690 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-14 05:47:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:47:15,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:57,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_2329 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_2324 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2320 (Array Int Int)) (v_ArrVal_2326 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_2317 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse7 (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2315) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2317) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_2320) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_2324) (+ (* 4 (select .cse1 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|) .cse4 v_ArrVal_2326) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_2329) |c_~#queue~0.base|) .cse2))) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< v_ArrVal_2324 (+ (select .cse1 .cse2) 1)) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))))) is different from false [2024-11-14 05:47:57,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_2329 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_2324 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2320 (Array Int Int)) (v_ArrVal_2326 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_2317 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse7 (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2315) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2317) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_2320) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_2324) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|) .cse4 v_ArrVal_2326) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_2329) |c_~#queue~0.base|) .cse2))) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< v_ArrVal_2324 (+ (select .cse1 .cse2) 1)) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))))) is different from false [2024-11-14 05:48:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:48:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977295392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629831163] [2024-11-14 05:48:04,950 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:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) 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-14 05:48:04,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:04,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 21] total 44 [2024-11-14 05:48:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437644051] [2024-11-14 05:48:04,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 05:48:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:48:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 05:48:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1542, Unknown=86, NotChecked=170, Total=2070 [2024-11-14 05:48:04,953 INFO L87 Difference]: Start difference. First operand 1501 states and 3659 transitions. Second operand has 46 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 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-14 05:48:18,084 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-14 05:48:20,306 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-14 05:48:22,354 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-14 05:48:28,682 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-14 05:48:30,787 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-14 05:48:35,088 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-14 05:48:39,462 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-14 05:48:41,485 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-14 05:48:44,492 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-14 05:48:46,502 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-14 05:48:48,569 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-14 05:48:50,594 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-14 05:48:52,600 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-14 05:48:54,686 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-14 05:48:56,714 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-14 05:48:58,722 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-14 05:49:00,726 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-14 05:49:02,736 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-14 05:49:04,740 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-14 05:49:06,749 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-14 05:49:08,757 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-14 05:49:10,775 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-14 05:49:12,803 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-14 05:49:14,815 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-14 05:49:16,860 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-14 05:49:19,039 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-14 05:49:21,056 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-14 05:49:23,087 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-14 05:49:25,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-14 05:49:27,135 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-14 05:49:29,149 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-14 05:49:31,156 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-14 05:49:33,163 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-14 05:49:35,167 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-14 05:49:37,186 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-14 05:49:39,189 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-14 05:49:41,205 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-14 05:49:43,212 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-14 05:49:45,229 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-14 05:49:47,257 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-14 05:49:51,716 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-14 05:49:53,731 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-14 05:49:55,739 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-14 05:49:57,742 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-14 05:49:59,747 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-14 05:50:01,759 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-14 05:50:03,763 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-14 05:50:05,770 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-14 05:50:07,784 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-14 05:50:09,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-14 05:50:12,054 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-14 05:50:14,071 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-14 05:50:16,115 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-14 05:50:18,120 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-14 05:50:24,565 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-14 05:50:26,586 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-14 05:50:28,591 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-14 05:50:30,616 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-14 05:50:32,618 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-14 05:50:34,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-14 05:50:36,648 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-14 05:50:38,681 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-14 05:50:40,824 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-14 05:50:42,842 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-14 05:50:44,864 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-14 05:50:46,896 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-14 05:50:48,901 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-14 05:50:50,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:50:52,954 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-14 05:50:55,104 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-14 05:50:57,155 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-14 05:50:59,225 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-14 05:51:01,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-14 05:51:03,438 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-14 05:51:05,471 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-14 05:51:07,520 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-14 05:51:09,544 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-14 05:51:11,575 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-14 05:51:13,581 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-14 05:51:15,586 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-14 05:51:17,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-14 05:51:19,609 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-14 05:51:21,614 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-14 05:51:23,637 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-14 05:51:25,642 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-14 05:51:27,868 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-14 05:51:29,872 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-14 05:51:32,097 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-14 05:51:34,102 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-14 05:51:36,110 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-14 05:51:38,116 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-14 05:51:40,163 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-14 05:51:42,237 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-14 05:51:44,255 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-14 05:51:46,258 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-14 05:51:48,265 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-14 05:51:50,272 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-14 05:51:52,276 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-14 05:51:54,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-14 05:51:57,289 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-14 05:52:15,700 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-14 05:52:34,574 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-14 05:52:36,581 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-14 05:52:46,679 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-14 05:52:59,575 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-14 05:53:01,585 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-14 05:53:03,643 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-14 05:53:05,654 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-14 05:53:07,801 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-14 05:53:09,812 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-14 05:53:11,835 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-14 05:53:13,842 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-14 05:53:15,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-14 05:53:17,925 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-14 05:53:19,946 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-14 05:53:21,950 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-14 05:53:23,982 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-14 05:53:44,338 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-14 05:53:46,349 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-14 05:53:48,357 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-14 05:53:50,362 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-14 05:53:52,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-14 05:53:56,124 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-14 05:53:58,130 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-14 05:54:00,135 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-14 05:54:02,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:04,148 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-14 05:54:06,152 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-14 05:54:08,156 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-14 05:54:10,160 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-14 05:54:12,175 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-14 05:54:14,192 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-14 05:54:16,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:54:18,505 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-14 05:54:20,519 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-14 05:54:22,523 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-14 05:54:24,947 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-14 05:54:26,952 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-14 05:54:29,048 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-14 05:54:31,056 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-14 05:54:33,063 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-14 05:54:35,066 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-14 05:54:37,069 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-14 05:54:39,075 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-14 05:54:59,500 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-14 05:55:01,745 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-14 05:55:08,763 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-14 05:55:10,768 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-14 05:55:12,775 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-14 05:55:21,377 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-14 05:55:23,381 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-14 05:55:25,391 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-14 05:55:27,396 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-14 05:55:29,406 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-14 05:55:31,974 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-14 05:55:33,978 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-14 05:55:44,729 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-14 05:55:46,800 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-14 05:55:48,804 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-14 05:55:50,809 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-14 05:55:52,813 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-14 05:55:59,252 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-14 05:56:09,843 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-14 05:56:11,857 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-14 05:56:13,894 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-14 05:56:20,086 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-14 05:56:22,388 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-14 05:56:24,396 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-14 05:56:32,789 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-14 05:56:34,793 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-14 05:56:36,823 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-14 05:56:38,836 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-14 05:56:43,116 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-14 05:56:45,124 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-14 05:56:47,145 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-14 05:56:49,156 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-14 05:56:51,175 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-14 05:56:53,241 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-14 05:56:55,250 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-14 05:56:57,258 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-14 05:56:59,265 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-14 05:57:01,272 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-14 05:57:03,292 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-14 05:57:05,300 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-14 05:57:07,322 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-14 05:57:09,333 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-14 05:57:11,340 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-14 05:57:13,346 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-14 05:57:15,355 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-14 05:57:17,362 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-14 05:57:19,369 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-14 05:57:21,378 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-14 05:57:31,600 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-14 05:57:33,609 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-14 05:57:35,618 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-14 05:57:37,629 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-14 05:57:39,663 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-14 05:57:40,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:57:43,015 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-14 05:57:51,284 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-14 05:57:53,294 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-14 05:57:55,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-14 05:57:57,309 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-14 05:57:59,319 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-14 05:58:01,326 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-14 05:58:02,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:58:04,860 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-14 05:58:06,872 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-14 05:58:08,876 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-14 05:58:19,353 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-14 05:58:21,386 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]