./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh --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 64bit --witnessprinter.graph.data.programhash ebc8d70dd3a6dd092ec9912a17d9918c446a44f9f568e0b66fefb63ce5d792d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:32:10,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:32:10,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2023-12-02 15:32:10,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:32:10,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:32:10,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:32:10,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:32:10,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:32:10,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:32:10,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:32:10,504 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:32:10,504 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:32:10,505 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:32:10,505 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:32:10,506 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:32:10,506 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:32:10,507 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:32:10,507 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:32:10,508 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:32:10,508 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:32:10,509 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:32:10,510 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:32:10,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:32:10,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:32:10,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:32:10,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:32:10,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:32:10,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:32:10,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:32:10,513 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 15:32:10,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:32:10,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:32:10,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:32:10,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:32:10,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:32:10,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:32:10,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:32:10,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:32:10,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:32:10,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:32:10,516 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:32:10,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:32:10,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:32:10,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:32:10,517 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:32:10,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:32:10,518 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebc8d70dd3a6dd092ec9912a17d9918c446a44f9f568e0b66fefb63ce5d792d1 [2023-12-02 15:32:10,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:32:10,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:32:10,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:32:10,771 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:32:10,772 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:32:10,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2023-12-02 15:32:13,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:32:13,844 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:32:13,845 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2023-12-02 15:32:13,869 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/data/675c16d52/deac2259d756400ca5a397ab299afac4/FLAG81735ff19 [2023-12-02 15:32:13,884 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/data/675c16d52/deac2259d756400ca5a397ab299afac4 [2023-12-02 15:32:13,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:32:13,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:32:13,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:32:13,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:32:13,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:32:13,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:32:13" (1/1) ... [2023-12-02 15:32:13,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6761576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:13, skipping insertion in model container [2023-12-02 15:32:13,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:32:13" (1/1) ... [2023-12-02 15:32:13,973 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:32:14,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:32:14,741 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:32:14,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:32:14,936 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:32:14,936 WARN L675 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:32:14,936 WARN L675 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:32:14,936 WARN L675 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:32:14,937 WARN L675 CHandler]: The function fgets is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:32:14,943 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:32:14,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14 WrapperNode [2023-12-02 15:32:14,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:32:14,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:32:14,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:32:14,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:32:14,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:14,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,014 INFO L138 Inliner]: procedures = 505, calls = 94, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 163 [2023-12-02 15:32:15,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:32:15,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:32:15,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:32:15,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:32:15,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:32:15,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:32:15,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:32:15,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:32:15,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (1/1) ... [2023-12-02 15:32:15,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:32:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:15,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:32:15,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-12-02 15:32:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-12-02 15:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2023-12-02 15:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-12-02 15:32:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-12-02 15:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-12-02 15:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:32:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2023-12-02 15:32:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2023-12-02 15:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2023-12-02 15:32:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2023-12-02 15:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-12-02 15:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:32:15,302 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:32:15,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:32:15,525 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:32:15,562 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:32:15,563 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:32:15,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:32:15 BoogieIcfgContainer [2023-12-02 15:32:15,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:32:15,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:32:15,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:32:15,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:32:15,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:32:13" (1/3) ... [2023-12-02 15:32:15,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca99ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:32:15, skipping insertion in model container [2023-12-02 15:32:15,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:14" (2/3) ... [2023-12-02 15:32:15,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca99ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:32:15, skipping insertion in model container [2023-12-02 15:32:15,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:32:15" (3/3) ... [2023-12-02 15:32:15,573 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2023-12-02 15:32:15,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:32:15,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-02 15:32:15,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:32:15,642 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7242ff99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:32:15,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-02 15:32:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 62 states have internal predecessors, (77), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:32:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:32:15,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:15,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:15,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:15,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -296961157, now seen corresponding path program 1 times [2023-12-02 15:32:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473346212] [2023-12-02 15:32:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:16,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473346212] [2023-12-02 15:32:16,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473346212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:16,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:16,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:32:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423524496] [2023-12-02 15:32:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:16,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:32:16,045 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 62 states have internal predecessors, (77), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:32:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:16,125 INFO L93 Difference]: Finished difference Result 164 states and 219 transitions. [2023-12-02 15:32:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:32:16,128 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-12-02 15:32:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:16,135 INFO L225 Difference]: With dead ends: 164 [2023-12-02 15:32:16,136 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 15:32:16,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:32:16,143 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:16,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 15:32:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 15:32:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 58 states have internal predecessors, (70), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 15:32:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2023-12-02 15:32:16,190 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 18 [2023-12-02 15:32:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:16,191 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2023-12-02 15:32:16,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:32:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2023-12-02 15:32:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 15:32:16,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:16,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:32:16,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:16,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1572497610, now seen corresponding path program 1 times [2023-12-02 15:32:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266398048] [2023-12-02 15:32:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:16,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266398048] [2023-12-02 15:32:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266398048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:32:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845320144] [2023-12-02 15:32:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:16,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:16,301 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:32:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:16,342 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2023-12-02 15:32:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:16,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2023-12-02 15:32:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:16,345 INFO L225 Difference]: With dead ends: 82 [2023-12-02 15:32:16,345 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 15:32:16,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:16,347 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:16,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 15:32:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-12-02 15:32:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 57 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 15:32:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2023-12-02 15:32:16,362 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 20 [2023-12-02 15:32:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:16,362 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2023-12-02 15:32:16,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:32:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2023-12-02 15:32:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:32:16,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:16,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:16,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:32:16,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:16,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1502785572, now seen corresponding path program 1 times [2023-12-02 15:32:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863237364] [2023-12-02 15:32:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:16,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863237364] [2023-12-02 15:32:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863237364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:32:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863449167] [2023-12-02 15:32:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:16,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:16,440 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:32:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:16,485 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2023-12-02 15:32:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-12-02 15:32:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:16,487 INFO L225 Difference]: With dead ends: 147 [2023-12-02 15:32:16,488 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 15:32:16,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:16,490 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:16,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 15:32:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2023-12-02 15:32:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 61 states have internal predecessors, (75), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:32:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2023-12-02 15:32:16,505 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 21 [2023-12-02 15:32:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:16,506 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2023-12-02 15:32:16,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:32:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2023-12-02 15:32:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 15:32:16,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:16,508 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:16,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:32:16,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:16,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash 604636002, now seen corresponding path program 1 times [2023-12-02 15:32:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905881812] [2023-12-02 15:32:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:32:16,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905881812] [2023-12-02 15:32:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905881812] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125304831] [2023-12-02 15:32:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:16,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:16,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:16,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:32:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:16,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:32:16,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:32:16,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125304831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:16,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 15:32:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939636631] [2023-12-02 15:32:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:16,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:16,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:16,837 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:32:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:16,900 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2023-12-02 15:32:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:16,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2023-12-02 15:32:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:16,905 INFO L225 Difference]: With dead ends: 135 [2023-12-02 15:32:16,905 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 15:32:16,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:16,908 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:16,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 15:32:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-12-02 15:32:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 65 states have internal predecessors, (80), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:32:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2023-12-02 15:32:16,929 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 32 [2023-12-02 15:32:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:16,929 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2023-12-02 15:32:16,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:32:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2023-12-02 15:32:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:32:16,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:16,932 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:16,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:32:17,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:17,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:17,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -717002115, now seen corresponding path program 1 times [2023-12-02 15:32:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053964559] [2023-12-02 15:32:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:32:17,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053964559] [2023-12-02 15:32:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053964559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:17,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:17,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:32:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165015372] [2023-12-02 15:32:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:17,215 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:32:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:17,254 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2023-12-02 15:32:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:17,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2023-12-02 15:32:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:17,257 INFO L225 Difference]: With dead ends: 91 [2023-12-02 15:32:17,257 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 15:32:17,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:17,259 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:17,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 15:32:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2023-12-02 15:32:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 64 states have internal predecessors, (79), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:32:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-02 15:32:17,274 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 34 [2023-12-02 15:32:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:17,274 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-02 15:32:17,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:32:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-02 15:32:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 15:32:17,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:17,277 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:17,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:32:17,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:17,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash -752228960, now seen corresponding path program 1 times [2023-12-02 15:32:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:17,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867078862] [2023-12-02 15:32:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:32:17,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:17,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867078862] [2023-12-02 15:32:17,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867078862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:17,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:17,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:32:17,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321211724] [2023-12-02 15:32:17,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:17,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:17,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:17,343 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:32:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:17,376 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2023-12-02 15:32:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2023-12-02 15:32:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:17,379 INFO L225 Difference]: With dead ends: 90 [2023-12-02 15:32:17,379 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 15:32:17,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:17,380 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:17,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 15:32:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-12-02 15:32:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.3) internal successors, (78), 63 states have internal predecessors, (78), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:32:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2023-12-02 15:32:17,393 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 35 [2023-12-02 15:32:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2023-12-02 15:32:17,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:32:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2023-12-02 15:32:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 15:32:17,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:17,396 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-12-02 15:32:17,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:32:17,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:17,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 703582655, now seen corresponding path program 1 times [2023-12-02 15:32:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730168081] [2023-12-02 15:32:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:32:17,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730168081] [2023-12-02 15:32:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730168081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821777216] [2023-12-02 15:32:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:17,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:17,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:32:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:17,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:32:17,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:32:17,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821777216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:17,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-12-02 15:32:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797114430] [2023-12-02 15:32:17,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:17,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:17,654 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 15:32:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:17,689 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2023-12-02 15:32:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-12-02 15:32:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:17,692 INFO L225 Difference]: With dead ends: 111 [2023-12-02 15:32:17,692 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 15:32:17,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:17,693 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:17,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 179 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 15:32:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-12-02 15:32:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.296875) internal successors, (83), 67 states have internal predecessors, (83), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2023-12-02 15:32:17,703 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 42 [2023-12-02 15:32:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:17,703 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2023-12-02 15:32:17,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 15:32:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2023-12-02 15:32:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 15:32:17,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:17,705 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-12-02 15:32:17,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:32:17,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:17,909 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:17,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash 336225986, now seen corresponding path program 1 times [2023-12-02 15:32:17,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:17,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424832473] [2023-12-02 15:32:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:32:17,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424832473] [2023-12-02 15:32:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424832473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670699796] [2023-12-02 15:32:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:17,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:17,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:17,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:32:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:18,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:32:18,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:32:18,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670699796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:18,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-12-02 15:32:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129103974] [2023-12-02 15:32:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:18,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:18,123 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 15:32:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:18,155 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2023-12-02 15:32:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:18,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-12-02 15:32:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:18,156 INFO L225 Difference]: With dead ends: 93 [2023-12-02 15:32:18,156 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 15:32:18,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:18,158 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:18,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 166 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 15:32:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-02 15:32:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.28125) internal successors, (82), 66 states have internal predecessors, (82), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2023-12-02 15:32:18,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 43 [2023-12-02 15:32:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:18,167 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2023-12-02 15:32:18,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 15:32:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2023-12-02 15:32:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 15:32:18,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:18,169 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-12-02 15:32:18,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:32:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:18,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:18,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1560334790, now seen corresponding path program 1 times [2023-12-02 15:32:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351150861] [2023-12-02 15:32:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 15:32:18,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351150861] [2023-12-02 15:32:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351150861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945311371] [2023-12-02 15:32:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:18,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:18,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:32:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:18,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:32:18,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:32:18,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945311371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:18,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 15:32:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380098079] [2023-12-02 15:32:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:18,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:18,631 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 15:32:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:18,663 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2023-12-02 15:32:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2023-12-02 15:32:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:18,665 INFO L225 Difference]: With dead ends: 111 [2023-12-02 15:32:18,665 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 15:32:18,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:18,666 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:18,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 15:32:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-12-02 15:32:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.253968253968254) internal successors, (79), 64 states have internal predecessors, (79), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2023-12-02 15:32:18,676 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 46 [2023-12-02 15:32:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:18,676 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2023-12-02 15:32:18,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 15:32:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2023-12-02 15:32:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 15:32:18,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:18,678 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:18,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:32:18,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:18,886 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:18,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1372838386, now seen corresponding path program 1 times [2023-12-02 15:32:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885691575] [2023-12-02 15:32:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:18,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885691575] [2023-12-02 15:32:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885691575] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543187000] [2023-12-02 15:32:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:18,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:18,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:18,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:32:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:19,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:32:19,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:32:19,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543187000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:19,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-12-02 15:32:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678489471] [2023-12-02 15:32:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:19,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:19,104 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:32:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:19,125 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2023-12-02 15:32:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 52 [2023-12-02 15:32:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:19,127 INFO L225 Difference]: With dead ends: 90 [2023-12-02 15:32:19,127 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 15:32:19,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:32:19,128 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 15:32:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 15:32:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2023-12-02 15:32:19,136 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 52 [2023-12-02 15:32:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:19,137 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2023-12-02 15:32:19,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:32:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2023-12-02 15:32:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 15:32:19,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:19,139 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:19,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:32:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 15:32:19,345 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:19,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 391683184, now seen corresponding path program 1 times [2023-12-02 15:32:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157330789] [2023-12-02 15:32:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:19,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157330789] [2023-12-02 15:32:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157330789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475921402] [2023-12-02 15:32:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:19,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:19,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:32:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:19,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:32:19,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 15:32:19,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475921402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 15:32:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165503637] [2023-12-02 15:32:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:19,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:19,572 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:19,606 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2023-12-02 15:32:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:32:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2023-12-02 15:32:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:19,608 INFO L225 Difference]: With dead ends: 129 [2023-12-02 15:32:19,608 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 15:32:19,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:19,609 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:19,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 15:32:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 15:32:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-02 15:32:19,619 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 53 [2023-12-02 15:32:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:19,619 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-02 15:32:19,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-02 15:32:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:32:19,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:19,621 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:19,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:32:19,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 15:32:19,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:19,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1846524875, now seen corresponding path program 1 times [2023-12-02 15:32:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:19,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296734378] [2023-12-02 15:32:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:19,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296734378] [2023-12-02 15:32:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296734378] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675535526] [2023-12-02 15:32:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:19,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:19,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:19,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:32:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:20,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:32:20,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:32:20,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675535526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 15:32:20,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636699461] [2023-12-02 15:32:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:20,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:20,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:20,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:20,072 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:20,102 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2023-12-02 15:32:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:32:20,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2023-12-02 15:32:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:20,104 INFO L225 Difference]: With dead ends: 125 [2023-12-02 15:32:20,104 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 15:32:20,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:20,105 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:20,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 15:32:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 15:32:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 63 states have internal predecessors, (75), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2023-12-02 15:32:20,111 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 55 [2023-12-02 15:32:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:20,112 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2023-12-02 15:32:20,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2023-12-02 15:32:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 15:32:20,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:20,113 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:20,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:32:20,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 15:32:20,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:20,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1445464719, now seen corresponding path program 1 times [2023-12-02 15:32:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:20,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116428500] [2023-12-02 15:32:20,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:20,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116428500] [2023-12-02 15:32:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116428500] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562689315] [2023-12-02 15:32:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:20,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:20,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:20,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:32:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:20,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:32:20,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 15:32:20,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562689315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:32:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 15:32:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010446443] [2023-12-02 15:32:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:20,538 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:20,569 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2023-12-02 15:32:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:32:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2023-12-02 15:32:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:20,570 INFO L225 Difference]: With dead ends: 101 [2023-12-02 15:32:20,571 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 15:32:20,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:32:20,572 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:20,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 15:32:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 15:32:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 15:32:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2023-12-02 15:32:20,580 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 56 [2023-12-02 15:32:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:20,580 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2023-12-02 15:32:20,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 15:32:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2023-12-02 15:32:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 15:32:20,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:20,582 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:20,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:32:20,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:20,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:20,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 963215579, now seen corresponding path program 1 times [2023-12-02 15:32:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449227730] [2023-12-02 15:32:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 15:32:20,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449227730] [2023-12-02 15:32:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449227730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:20,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:32:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921769473] [2023-12-02 15:32:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:20,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:32:20,846 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:32:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:20,868 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2023-12-02 15:32:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:32:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2023-12-02 15:32:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:20,870 INFO L225 Difference]: With dead ends: 103 [2023-12-02 15:32:20,870 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 15:32:20,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:32:20,871 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:20,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:32:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 15:32:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-02 15:32:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:32:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2023-12-02 15:32:20,877 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 61 [2023-12-02 15:32:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:20,877 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2023-12-02 15:32:20,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:32:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2023-12-02 15:32:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 15:32:20,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:20,879 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:20,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 15:32:20,879 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 15:32:20,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash 123157084, now seen corresponding path program 1 times [2023-12-02 15:32:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301509126] [2023-12-02 15:32:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:21,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301509126] [2023-12-02 15:32:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301509126] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417718359] [2023-12-02 15:32:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:21,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:21,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:32:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:21,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:32:21,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:21,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:32:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417718359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:32:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156067600] [2023-12-02 15:32:21,281 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2023-12-02 15:32:21,281 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:32:21,285 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:32:21,290 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:32:21,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:32:26,279 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 24 for LOIs [2023-12-02 15:32:26,282 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 157 for LOIs [2023-12-02 15:32:26,323 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 171 for LOIs [2023-12-02 15:32:26,425 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 99 for LOIs [2023-12-02 15:32:26,444 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:32:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [156067600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:57,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2023-12-02 15:32:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244841514] [2023-12-02 15:32:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 15:32:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:57,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 15:32:57,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1466, Unknown=13, NotChecked=0, Total=1640 [2023-12-02 15:32:57,706 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 34 states, 25 states have (on average 1.48) internal successors, (37), 28 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:33:00,668 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 [0] [2023-12-02 15:33:03,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 [0] [2023-12-02 15:33:05,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 [0] [2023-12-02 15:33:07,366 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 [0] [2023-12-02 15:33:09,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:33:11,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:33:13,573 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 [0] [2023-12-02 15:33:20,488 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 [0] [2023-12-02 15:33:22,518 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 [0] [2023-12-02 15:33:24,540 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 [0] [2023-12-02 15:33:26,605 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 [0] [2023-12-02 15:33:28,672 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 [0] [2023-12-02 15:33:30,699 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 [0] [2023-12-02 15:33:32,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:33:34,754 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 [0] [2023-12-02 15:33:36,762 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 [0] [2023-12-02 15:33:38,769 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 [0] [2023-12-02 15:33:41,070 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 [0] [2023-12-02 15:33:43,334 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 [0] [2023-12-02 15:33:46,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 [0] [2023-12-02 15:33:48,603 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 [0] [2023-12-02 15:33:50,659 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 [0] [2023-12-02 15:33:52,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:33:54,699 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 [0] [2023-12-02 15:33:56,704 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 [0] [2023-12-02 15:33:58,891 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 [0] [2023-12-02 15:34:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:08,484 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2023-12-02 15:34:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 15:34:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 28 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 63 [2023-12-02 15:34:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:08,485 INFO L225 Difference]: With dead ends: 151 [2023-12-02 15:34:08,485 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 15:34:08,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=191, Invalid=1776, Unknown=13, NotChecked=0, Total=1980 [2023-12-02 15:34:08,487 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 25 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:08,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 305 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1801 Invalid, 35 Unknown, 0 Unchecked, 68.1s Time] [2023-12-02 15:34:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 15:34:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 15:34:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 15:34:08,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2023-12-02 15:34:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:08,489 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 15:34:08,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 28 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:34:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 15:34:08,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 15:34:08,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-12-02 15:34:08,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-12-02 15:34:08,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-12-02 15:34:08,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-12-02 15:34:08,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-12-02 15:34:08,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-12-02 15:34:08,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-12-02 15:34:08,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-12-02 15:34:08,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:34:08,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 15:34:08,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 15:34:15,000 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 225 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 15:34:23,690 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 228 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 15:34:26,251 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-12-02 15:34:26,251 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-12-02 15:34:26,251 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2023-12-02 15:34:26,251 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2023-12-02 15:34:26,251 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-12-02 15:34:26,251 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-12-02 15:34:26,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2023-12-02 15:34:26,251 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1591) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1556 1593) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2023-12-02 15:34:26,252 INFO L899 garLoopResultBuilder]: For program point L1564-2(lines 1564 1571) no Hoare annotation was computed. [2023-12-02 15:34:26,253 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= ~globalFalse~0 0) (<= 1 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,253 INFO L899 garLoopResultBuilder]: For program point L1589-1(line 1589) no Hoare annotation was computed. [2023-12-02 15:34:26,253 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1625) no Hoare annotation was computed. [2023-12-02 15:34:26,254 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2023-12-02 15:34:26,254 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,254 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2023-12-02 15:34:26,254 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1611) no Hoare annotation was computed. [2023-12-02 15:34:26,255 INFO L895 garLoopResultBuilder]: At program point L1598-4(lines 1598 1611) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalArgc~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,255 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (<= 1 |ULTIMATE.start_goodB2G2_~data~1#1|) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1623-1(line 1623) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1590) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1640(line 1640) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1640-1(lines 1640 1647) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2023-12-02 15:34:26,256 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1592) no Hoare annotation was computed. [2023-12-02 15:34:26,257 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_goodG2B1_~data~2#1| 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,257 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2023-12-02 15:34:26,257 INFO L899 garLoopResultBuilder]: For program point L1632-2(lines 1632 1639) no Hoare annotation was computed. [2023-12-02 15:34:26,258 INFO L895 garLoopResultBuilder]: At program point L1632-4(lines 1632 1639) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,258 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2023-12-02 15:34:26,258 INFO L899 garLoopResultBuilder]: For program point L1657-1(lines 1657 1664) no Hoare annotation was computed. [2023-12-02 15:34:26,258 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1665) no Hoare annotation was computed. [2023-12-02 15:34:26,258 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1624) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1))) (and (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0) (= ~GLOBAL_CONST_FALSE~0 0) (<= .cse0 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (let ((.cse1 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (<= .cse0 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (= |#valid| (store .cse1 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| 1)) (= 16 (select |v_#length_8| 7)) (= (select .cse1 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| (store (select |v_#memory_$Pointer$.base_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0)))) (= (select |v_#valid_12| 3) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| (store (select |v_#memory_$Pointer$.offset_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0)))) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| 14) |#length|) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= |#memory_int| (let ((.cse2 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse2) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| .cse2))) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1))) [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1608-1(line 1608) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1584(line 1584) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2023-12-02 15:34:26,259 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: false [2023-12-02 15:34:26,259 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2023-12-02 15:34:26,260 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2023-12-02 15:34:26,260 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2023-12-02 15:34:26,260 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,260 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2023-12-02 15:34:26,260 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2023-12-02 15:34:26,261 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,261 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2023-12-02 15:34:26,261 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741822) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= ~globalFalse~0 0) (<= 1 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,261 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2023-12-02 15:34:26,261 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L895 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= |ULTIMATE.start_main_#t~nondet117#1.offset| 0) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= |ULTIMATE.start_main_#t~nondet117#1.base| 10) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1609) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point L1602-2(lines 1602 1609) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2023-12-02 15:34:26,262 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1627) no Hoare annotation was computed. [2023-12-02 15:34:26,263 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (<= 1 |ULTIMATE.start_goodB2G2_~data~1#1|) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 1073741822) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,263 INFO L899 garLoopResultBuilder]: For program point L1619-1(line 1619) no Hoare annotation was computed. [2023-12-02 15:34:26,263 INFO L899 garLoopResultBuilder]: For program point L1644(line 1644) no Hoare annotation was computed. [2023-12-02 15:34:26,263 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2023-12-02 15:34:26,264 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (exists ((|v_#memory_int_10| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select (select |v_#memory_int_10| 2) 0) 0) (= |#memory_int| (store |v_#memory_int_10| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| (store ((as const (Array Int Int)) 0) 0 0))) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#length_8| (Array Int Int))) (and (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#length_8| 5) 54) (= 16 (select |v_#length_8| 3)) (= 21 (select |v_#length_8| 9)) (= 16 (select |v_#length_8| 7)) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select |v_#length_8| 1) 1) (= |#length| (store |v_#length_8| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| 14)) (= (select |v_#length_8| 11) 16))) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (exists ((|v_#valid_12| (Array Int Int))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#valid_12| 10) 1) (= (select |v_#valid_12| 5) 1) (= (select |v_#valid_12| 3) 1) (= (select |v_#valid_12| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 0) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#valid_12| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| 1) |#valid|) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1))) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,264 INFO L899 garLoopResultBuilder]: For program point L1570-1(line 1570) no Hoare annotation was computed. [2023-12-02 15:34:26,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2023-12-02 15:34:26,264 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2023-12-02 15:34:26,264 INFO L899 garLoopResultBuilder]: For program point L1628(lines 1628 1648) no Hoare annotation was computed. [2023-12-02 15:34:26,264 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2023-12-02 15:34:26,265 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_goodG2B2_~data~3#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,265 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2023-12-02 15:34:26,265 INFO L895 garLoopResultBuilder]: At program point L1653-4(lines 1653 1656) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,265 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2023-12-02 15:34:26,266 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_goodG2B1_~result~2#1| 4) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 8) 54) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= (select |v_#length_8| 5) 54) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 15:34:26,266 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2023-12-02 15:34:26,266 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2023-12-02 15:34:26,266 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2023-12-02 15:34:26,266 INFO L899 garLoopResultBuilder]: For program point L1612-1(lines 1612 1626) no Hoare annotation was computed. [2023-12-02 15:34:26,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-12-02 15:34:26,267 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2023-12-02 15:34:26,267 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2023-12-02 15:34:26,270 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:26,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:34:26,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:34:26 BoogieIcfgContainer [2023-12-02 15:34:26,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:34:26,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:34:26,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:34:26,277 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:34:26,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:32:15" (3/4) ... [2023-12-02 15:34:26,279 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 15:34:26,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-12-02 15:34:26,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2023-12-02 15:34:26,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-12-02 15:34:26,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2023-12-02 15:34:26,288 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-12-02 15:34:26,289 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-12-02 15:34:26,289 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 15:34:26,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:34:26,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:34:26,376 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:34:26,376 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 15:34:26,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:34:26,377 INFO L158 Benchmark]: Toolchain (without parser) took 132488.94ms. Allocated memory was 132.1MB in the beginning and 352.3MB in the end (delta: 220.2MB). Free memory was 73.6MB in the beginning and 286.5MB in the end (delta: -213.0MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,377 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:34:26,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1054.41ms. Allocated memory is still 132.1MB. Free memory was 73.3MB in the beginning and 95.7MB in the end (delta: -22.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.74ms. Allocated memory is still 132.1MB. Free memory was 95.7MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,378 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 132.1MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,379 INFO L158 Benchmark]: RCFGBuilder took 506.25ms. Allocated memory is still 132.1MB. Free memory was 90.9MB in the beginning and 69.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,379 INFO L158 Benchmark]: TraceAbstraction took 130708.96ms. Allocated memory was 132.1MB in the beginning and 352.3MB in the end (delta: 220.2MB). Free memory was 68.4MB in the beginning and 293.9MB in the end (delta: -225.4MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,379 INFO L158 Benchmark]: Witness Printer took 99.41ms. Allocated memory is still 352.3MB. Free memory was 293.9MB in the beginning and 286.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 15:34:26,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1054.41ms. Allocated memory is still 132.1MB. Free memory was 73.3MB in the beginning and 95.7MB in the end (delta: -22.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.74ms. Allocated memory is still 132.1MB. Free memory was 95.7MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 132.1MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.25ms. Allocated memory is still 132.1MB. Free memory was 90.9MB in the beginning and 69.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 130708.96ms. Allocated memory was 132.1MB in the beginning and 352.3MB in the end (delta: 220.2MB). Free memory was 68.4MB in the beginning and 293.9MB in the end (delta: -225.4MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. * Witness Printer took 99.41ms. Allocated memory is still 352.3MB. Free memory was 293.9MB in the beginning and 286.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 130.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 71.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 68.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 3259 SdHoareTripleChecker+Invalid, 67.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1912 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2107 IncrementalHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1347 mSDtfsCounter, 2107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 116 PreInvPairs, 133 NumberOfFragments, 4328 HoareAnnotationTreeSize, 116 FomulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 24 FomulaSimplificationsInter, 5944 FormulaSimplificationTreeSizeReductionInter, 17.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2068 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 475/498 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 5.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 57, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 41, TOOLS_POST_TIME: 1.8s, TOOLS_POST_CALL_APPLICATIONS: 30, TOOLS_POST_CALL_TIME: 1.2s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 1.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 91, TOOLS_QUANTIFIERELIM_TIME: 4.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 136, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 57, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 1796, DAG_COMPRESSION_RETAINED_NODES: 139, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-02 15:34:26,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa79166-1306-474f-9996-ee4339ef2f4f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE