./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/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_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/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 32bit --witnessprinter.graph.data.programhash bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:22:07,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:22:07,854 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 12:22:07,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:22:07,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:22:07,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:22:07,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:22:07,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:22:07,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:22:07,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:22:07,890 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:22:07,891 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:22:07,891 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:22:07,892 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:22:07,893 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:22:07,893 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:22:07,894 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:22:07,894 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:22:07,895 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:22:07,896 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:22:07,896 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:22:07,897 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:22:07,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:22:07,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:22:07,899 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:22:07,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:22:07,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:22:07,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:22:07,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:22:07,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:22:07,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:22:07,902 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 12:22:07,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:22:07,903 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:22:07,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:22:07,904 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:22:07,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:22:07,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:22:07,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:22:07,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:22:07,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:22:07,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:22:07,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:22:07,906 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:22:07,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:22:07,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:22:07,907 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:22:07,907 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:22:07,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:22:07,907 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_102875dc-c299-4bcb-8136-6869fa90f5cb/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_102875dc-c299-4bcb-8136-6869fa90f5cb/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2023-12-02 12:22:08,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:22:08,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:22:08,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:22:08,264 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:22:08,265 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:22:08,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2023-12-02 12:22:11,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:22:11,617 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:22:11,618 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2023-12-02 12:22:11,640 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/data/f515fe6d8/1ae458668a2346e3be51312d8f7556d3/FLAG7e4400e1b [2023-12-02 12:22:11,658 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/data/f515fe6d8/1ae458668a2346e3be51312d8f7556d3 [2023-12-02 12:22:11,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:22:11,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:22:11,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:22:11,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:22:11,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:22:11,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636a2262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11, skipping insertion in model container [2023-12-02 12:22:11,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,735 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:22:12,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:22:12,254 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:22:12,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:22:12,367 WARN L675 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:22:12,376 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:22:12,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12 WrapperNode [2023-12-02 12:22:12,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:22:12,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:22:12,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:22:12,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:22:12,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,440 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2023-12-02 12:22:12,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:22:12,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:22:12,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:22:12,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:22:12,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:22:12,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:22:12,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:22:12,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:22:12,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (1/1) ... [2023-12-02 12:22:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:22:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:12,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:22:12,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:22:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-12-02 12:22:12,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-12-02 12:22:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:22:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:22:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:22:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:22:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:22:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:22:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:22:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:22:12,722 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:22:12,725 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:22:12,953 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:22:13,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:22:13,035 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 12:22:13,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:22:13 BoogieIcfgContainer [2023-12-02 12:22:13,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:22:13,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:22:13,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:22:13,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:22:13,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:22:11" (1/3) ... [2023-12-02 12:22:13,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1952c0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:22:13, skipping insertion in model container [2023-12-02 12:22:13,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:12" (2/3) ... [2023-12-02 12:22:13,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1952c0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:22:13, skipping insertion in model container [2023-12-02 12:22:13,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:22:13" (3/3) ... [2023-12-02 12:22:13,048 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2023-12-02 12:22:13,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:22:13,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-12-02 12:22:13,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:22:13,129 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;@38e2cc40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:22:13,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-12-02 12:22:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:22:13,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:13,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:13,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:13,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724774, now seen corresponding path program 1 times [2023-12-02 12:22:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:13,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064700979] [2023-12-02 12:22:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:13,489 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 12:22:13,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064700979] [2023-12-02 12:22:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064700979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:13,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:13,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246130777] [2023-12-02 12:22:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:13,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:22:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:22:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:22:13,538 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:13,671 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2023-12-02 12:22:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:22:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-12-02 12:22:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:13,682 INFO L225 Difference]: With dead ends: 65 [2023-12-02 12:22:13,682 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 12:22:13,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:13,689 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:13,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 115 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:22:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 12:22:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2023-12-02 12:22:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.625) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-12-02 12:22:13,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2023-12-02 12:22:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:13,731 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-12-02 12:22:13,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-12-02 12:22:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:22:13,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:13,733 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:13,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:22:13,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:13,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 683916081, now seen corresponding path program 1 times [2023-12-02 12:22:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115689833] [2023-12-02 12:22:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:13,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115689833] [2023-12-02 12:22:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115689833] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953018630] [2023-12-02 12:22:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:13,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:13,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:13,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:13,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:22:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:14,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:22:14,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:14,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:22:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953018630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:22:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 12:22:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034970240] [2023-12-02 12:22:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:22:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:22:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:22:14,148 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:14,265 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2023-12-02 12:22:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:22:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-02 12:22:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:14,268 INFO L225 Difference]: With dead ends: 60 [2023-12-02 12:22:14,268 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 12:22:14,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:22:14,271 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:14,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:22:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 12:22:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2023-12-02 12:22:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-12-02 12:22:14,282 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2023-12-02 12:22:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:14,282 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-12-02 12:22:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-12-02 12:22:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:22:14,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:14,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:14,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:22:14,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:14,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:14,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 699757149, now seen corresponding path program 1 times [2023-12-02 12:22:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607239148] [2023-12-02 12:22:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:14,581 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 12:22:14,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607239148] [2023-12-02 12:22:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607239148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027491754] [2023-12-02 12:22:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:14,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:22:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:22:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:22:14,584 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:14,645 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-02 12:22:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:22:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-02 12:22:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:14,647 INFO L225 Difference]: With dead ends: 41 [2023-12-02 12:22:14,647 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 12:22:14,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:14,649 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:14,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 12:22:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-02 12:22:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-02 12:22:14,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2023-12-02 12:22:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:14,659 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-02 12:22:14,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-02 12:22:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:22:14,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:14,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:14,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:22:14,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:14,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash -273437899, now seen corresponding path program 1 times [2023-12-02 12:22:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:14,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125241134] [2023-12-02 12:22:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:14,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125241134] [2023-12-02 12:22:14,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125241134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573994183] [2023-12-02 12:22:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:14,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:14,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:22:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:14,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:22:14,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:14,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573994183] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:14,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [332878852] [2023-12-02 12:22:15,009 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 12:22:15,009 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:15,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:15,018 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:15,018 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:16,545 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 64 for LOIs [2023-12-02 12:22:16,627 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:18,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [332878852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:18,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2023-12-02 12:22:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404899248] [2023-12-02 12:22:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:18,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:22:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:22:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-12-02 12:22:18,671 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:20,604 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-12-02 12:22:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:22:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 12:22:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:20,606 INFO L225 Difference]: With dead ends: 54 [2023-12-02 12:22:20,606 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 12:22:20,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=78, Invalid=427, Unknown=1, NotChecked=0, Total=506 [2023-12-02 12:22:20,608 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:20,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 12:22:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 12:22:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2023-12-02 12:22:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-02 12:22:20,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2023-12-02 12:22:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:20,626 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-02 12:22:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-02 12:22:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 12:22:20,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:20,628 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:20,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:22:20,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:20,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:20,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash -245284404, now seen corresponding path program 1 times [2023-12-02 12:22:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955031936] [2023-12-02 12:22:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:20,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:22:20,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955031936] [2023-12-02 12:22:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955031936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:20,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:20,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570905800] [2023-12-02 12:22:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:20,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:22:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:22:20,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:22:20,907 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:20,998 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2023-12-02 12:22:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:22:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-12-02 12:22:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:21,001 INFO L225 Difference]: With dead ends: 58 [2023-12-02 12:22:21,002 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 12:22:21,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:21,005 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:21,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:22:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 12:22:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-12-02 12:22:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 42 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 12:22:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-12-02 12:22:21,024 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2023-12-02 12:22:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:21,025 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-12-02 12:22:21,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-12-02 12:22:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 12:22:21,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:21,027 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:21,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:22:21,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:21,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1305891366, now seen corresponding path program 1 times [2023-12-02 12:22:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382104932] [2023-12-02 12:22:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:22:21,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:21,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382104932] [2023-12-02 12:22:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382104932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:22:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953593701] [2023-12-02 12:22:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:21,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:22:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:22:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:21,159 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:21,267 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-12-02 12:22:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:22:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-02 12:22:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:21,269 INFO L225 Difference]: With dead ends: 63 [2023-12-02 12:22:21,269 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 12:22:21,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:22:21,270 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:21,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:22:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 12:22:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-12-02 12:22:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.411764705882353) internal successors, (48), 42 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 12:22:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2023-12-02 12:22:21,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2023-12-02 12:22:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:21,289 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2023-12-02 12:22:21,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:22:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2023-12-02 12:22:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 12:22:21,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:21,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:21,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 12:22:21,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:21,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1593506044, now seen corresponding path program 1 times [2023-12-02 12:22:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:21,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797684255] [2023-12-02 12:22:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:22:21,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797684255] [2023-12-02 12:22:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797684255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:22:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406304184] [2023-12-02 12:22:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:22:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:22:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:22:21,359 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:21,432 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2023-12-02 12:22:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:22:21,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-02 12:22:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:21,434 INFO L225 Difference]: With dead ends: 65 [2023-12-02 12:22:21,434 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 12:22:21,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:21,435 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:21,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 12:22:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-12-02 12:22:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4) internal successors, (49), 43 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 12:22:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-12-02 12:22:21,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2023-12-02 12:22:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:21,454 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-12-02 12:22:21,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-12-02 12:22:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 12:22:21,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:21,456 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 12:22:21,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:21,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 314505745, now seen corresponding path program 1 times [2023-12-02 12:22:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971013056] [2023-12-02 12:22:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 12:22:21,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971013056] [2023-12-02 12:22:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971013056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:22:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434574965] [2023-12-02 12:22:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:21,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:22:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:22:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:22:21,587 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:21,651 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2023-12-02 12:22:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:22:21,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-02 12:22:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:21,653 INFO L225 Difference]: With dead ends: 88 [2023-12-02 12:22:21,653 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 12:22:21,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:21,655 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 12:22:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-12-02 12:22:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-12-02 12:22:21,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2023-12-02 12:22:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:21,672 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-12-02 12:22:21,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-12-02 12:22:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:22:21,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:21,674 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 12:22:21,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:21,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1997875160, now seen corresponding path program 1 times [2023-12-02 12:22:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771482829] [2023-12-02 12:22:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 12:22:21,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771482829] [2023-12-02 12:22:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771482829] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184686335] [2023-12-02 12:22:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:21,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:21,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:21,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:21,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:22:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:21,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 12:22:21,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:22:22,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:22:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184686335] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918134657] [2023-12-02 12:22:22,136 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 12:22:22,136 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:22,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:22,137 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:22,137 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:24,338 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 121 for LOIs [2023-12-02 12:22:24,421 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1918134657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 8, 8] total 26 [2023-12-02 12:22:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609477805] [2023-12-02 12:22:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:27,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 12:22:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 12:22:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2023-12-02 12:22:27,160 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:29,133 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-12-02 12:22:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 12:22:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-02 12:22:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:29,135 INFO L225 Difference]: With dead ends: 48 [2023-12-02 12:22:29,135 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 12:22:29,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=98, Invalid=893, Unknown=1, NotChecked=0, Total=992 [2023-12-02 12:22:29,136 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:29,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 12:22:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 12:22:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2023-12-02 12:22:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-12-02 12:22:29,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 25 [2023-12-02 12:22:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:29,151 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-12-02 12:22:29,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-12-02 12:22:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:22:29,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:29,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:29,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 12:22:29,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:29,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:29,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1236485174, now seen corresponding path program 1 times [2023-12-02 12:22:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:29,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873450840] [2023-12-02 12:22:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:22:29,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873450840] [2023-12-02 12:22:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873450840] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527229269] [2023-12-02 12:22:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:29,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:29,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:22:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:29,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:22:29,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:22:29,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:22:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527229269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:22:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 12:22:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259085604] [2023-12-02 12:22:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:29,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:22:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:22:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:22:29,632 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:29,706 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-02 12:22:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:22:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-02 12:22:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:29,708 INFO L225 Difference]: With dead ends: 41 [2023-12-02 12:22:29,708 INFO L226 Difference]: Without dead ends: 40 [2023-12-02 12:22:29,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:22:29,709 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:29,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-02 12:22:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-02 12:22:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-12-02 12:22:29,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2023-12-02 12:22:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:29,724 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-12-02 12:22:29,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-12-02 12:22:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 12:22:29,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:29,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:29,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 12:22:29,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 12:22:29,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:29,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash -323665132, now seen corresponding path program 1 times [2023-12-02 12:22:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405746434] [2023-12-02 12:22:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:22:30,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405746434] [2023-12-02 12:22:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405746434] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059040320] [2023-12-02 12:22:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:30,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:30,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:30,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:30,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:22:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:30,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:22:30,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:22:30,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:22:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059040320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073216765] [2023-12-02 12:22:30,232 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 12:22:30,232 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:30,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:30,233 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:30,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:31,778 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 121 for LOIs [2023-12-02 12:22:31,864 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:34,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1915#(and (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_alloc_17_#res#1| 0) (= |~#ldv_global_msg_list~0.base| 1) (or (and (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (<= 1 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= 1 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777215) (<= 1 |ULTIMATE.start_free_17_~len#1|) (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (and (<= 1 |ULTIMATE.start_free_17_~i~1#1|) (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (<= 2 |ULTIMATE.start_free_17_~len#1|) (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215) (<= |ULTIMATE.start_free_17_#in~len#1| 16777215) (<= |ULTIMATE.start_free_17_~len#1| 16777215))) (<= 2147483647 |ULTIMATE.start_free_17_#t~post46#1|))' at error location [2023-12-02 12:22:34,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:22:34,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 12:22:34,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604568557] [2023-12-02 12:22:34,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:22:34,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 12:22:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 12:22:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2023-12-02 12:22:34,815 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:34,970 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-12-02 12:22:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:22:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-12-02 12:22:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:34,971 INFO L225 Difference]: With dead ends: 50 [2023-12-02 12:22:34,971 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 12:22:34,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2023-12-02 12:22:34,973 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:34,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 12:22:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-02 12:22:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-12-02 12:22:34,993 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2023-12-02 12:22:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:34,993 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-12-02 12:22:34,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-12-02 12:22:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 12:22:34,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:34,994 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:35,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:22:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 12:22:35,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:35,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 892699432, now seen corresponding path program 1 times [2023-12-02 12:22:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686068602] [2023-12-02 12:22:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 12:22:35,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686068602] [2023-12-02 12:22:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686068602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:35,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:35,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:22:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111888575] [2023-12-02 12:22:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:22:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:22:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:35,274 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:35,313 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-02 12:22:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:22:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-12-02 12:22:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:35,315 INFO L225 Difference]: With dead ends: 49 [2023-12-02 12:22:35,315 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 12:22:35,316 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 12:22:35,316 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 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 12:22:35,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:22:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 12:22:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-02 12:22:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-12-02 12:22:35,331 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2023-12-02 12:22:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:35,332 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-12-02 12:22:35,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:22:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-12-02 12:22:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 12:22:35,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:35,333 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:35,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 12:22:35,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:35,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1903878734, now seen corresponding path program 1 times [2023-12-02 12:22:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807425817] [2023-12-02 12:22:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:22:35,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807425817] [2023-12-02 12:22:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807425817] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890254514] [2023-12-02 12:22:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:35,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:35,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:35,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:22:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:35,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 12:22:35,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:22:35,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:22:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890254514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314039198] [2023-12-02 12:22:35,835 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 12:22:35,835 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:35,835 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:35,835 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:35,836 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:37,409 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 115 for LOIs [2023-12-02 12:22:37,500 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:40,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [314039198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:40,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:40,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 29 [2023-12-02 12:22:40,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788933864] [2023-12-02 12:22:40,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:40,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:22:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:22:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2023-12-02 12:22:40,635 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:43,010 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2023-12-02 12:22:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 12:22:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-12-02 12:22:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:43,011 INFO L225 Difference]: With dead ends: 54 [2023-12-02 12:22:43,012 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 12:22:43,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=152, Invalid=1253, Unknown=1, NotChecked=0, Total=1406 [2023-12-02 12:22:43,013 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:43,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 12:22:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 12:22:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-12-02 12:22:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-12-02 12:22:43,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 29 [2023-12-02 12:22:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:43,026 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-12-02 12:22:43,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-12-02 12:22:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 12:22:43,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:43,027 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:43,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 12:22:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 12:22:43,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:43,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -886592752, now seen corresponding path program 1 times [2023-12-02 12:22:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038252408] [2023-12-02 12:22:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 12:22:43,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038252408] [2023-12-02 12:22:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038252408] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330261184] [2023-12-02 12:22:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:43,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:43,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:43,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:43,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:22:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:43,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 12:22:43,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:22:43,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 12:22:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330261184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1374902176] [2023-12-02 12:22:43,662 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 12:22:43,662 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:43,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:43,663 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:43,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:45,503 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 121 for LOIs [2023-12-02 12:22:45,601 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1374902176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 29 [2023-12-02 12:22:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404450895] [2023-12-02 12:22:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:22:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:22:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2023-12-02 12:22:48,586 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:50,734 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2023-12-02 12:22:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 12:22:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-12-02 12:22:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:50,735 INFO L225 Difference]: With dead ends: 52 [2023-12-02 12:22:50,735 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 12:22:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=152, Invalid=1253, Unknown=1, NotChecked=0, Total=1406 [2023-12-02 12:22:50,737 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:50,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 47 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 12:22:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 12:22:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2023-12-02 12:22:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:22:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-12-02 12:22:50,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2023-12-02 12:22:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:50,749 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-12-02 12:22:50,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:22:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-12-02 12:22:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 12:22:50,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:50,750 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:50,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 12:22:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 12:22:50,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-12-02 12:22:50,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1722460009, now seen corresponding path program 2 times [2023-12-02 12:22:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131407076] [2023-12-02 12:22:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 12:22:51,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131407076] [2023-12-02 12:22:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131407076] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:22:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074549365] [2023-12-02 12:22:51,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:22:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:22:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:51,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:22:51,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 12:22:51,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 12:22:51,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:22:51,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:22:51,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:22:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 12:22:51,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:22:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 12:22:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074549365] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:22:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891360209] [2023-12-02 12:22:51,425 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 12:22:51,425 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:22:51,426 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:22:51,426 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:22:51,426 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:22:53,307 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 121 for LOIs [2023-12-02 12:22:53,395 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:22:56,703 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3140#(and (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_alloc_17_#res#1| 0) (= |~#ldv_global_msg_list~0.base| 1) (or (and (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (<= 1 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= 1 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777215) (<= 1 |ULTIMATE.start_free_17_~len#1|) (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (and (<= 1 |ULTIMATE.start_free_17_~i~1#1|) (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (<= 2 |ULTIMATE.start_free_17_~len#1|) (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215) (<= |ULTIMATE.start_free_17_#in~len#1| 16777215) (<= |ULTIMATE.start_free_17_~len#1| 16777215))) (<= 2147483647 |ULTIMATE.start_free_17_#t~post46#1|))' at error location [2023-12-02 12:22:56,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:22:56,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:22:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 16 [2023-12-02 12:22:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969292807] [2023-12-02 12:22:56,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:22:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:22:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:22:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2023-12-02 12:22:56,705 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:22:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:57,064 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2023-12-02 12:22:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 12:22:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2023-12-02 12:22:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:57,065 INFO L225 Difference]: With dead ends: 86 [2023-12-02 12:22:57,065 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 12:22:57,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 12:22:57,067 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:57,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 145 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:22:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 12:22:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 12:22:57,068 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 12:22:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 12:22:57,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-12-02 12:22:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:57,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 12:22:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:22:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 12:22:57,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 12:22:57,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2023-12-02 12:22:57,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2023-12-02 12:22:57,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2023-12-02 12:22:57,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2023-12-02 12:22:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2023-12-02 12:22:57,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 12:22:57,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 12:22:57,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 12:22:59,342 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (let ((.cse0 (not (= |~#ldv_global_msg_list~0.offset| 0))) (.cse1 (< |#StackHeapBarrier| 1)) (.cse2 (not (= |~#ldv_global_msg_list~0.base| 1)))) (and (or (not (= |ldv_malloc_#in~size| 4)) (forall ((|v_ULTIMATE.start_entry_point_~i~2#1_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_alloc_17_#in~len#1_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_46| Int) (|v_ULTIMATE.start_ldv_positive_#res#1_BEFORE_CALL_46| Int) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_38| Int) (|v_ULTIMATE.start_alloc_17_~len#1_BEFORE_CALL_38| Int)) (or (< 16777215 |v_ULTIMATE.start_alloc_17_~len#1_BEFORE_CALL_38|) (< |v_ULTIMATE.start_alloc_17_~len#1_BEFORE_CALL_38| (+ |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_38| 1)) (< 16777215 |v_ULTIMATE.start_alloc_17_#in~len#1_BEFORE_CALL_32|) (< 16777215 |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_46|) (< (+ |v_ULTIMATE.start_alloc_17_#in~len#1_BEFORE_CALL_32| 2147483648) 0) .cse0 (< |v_ULTIMATE.start_entry_point_~i~2#1_BEFORE_CALL_32| 0) (< 16777215 |v_ULTIMATE.start_ldv_positive_#res#1_BEFORE_CALL_46|) .cse1 (< (+ |v_ULTIMATE.start_ldv_positive_#res#1_BEFORE_CALL_46| 2147483648) 0) (< (+ |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_46| 2147483648) 0) (< |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_38| 0) .cse2))) (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse5 (select |#memory_$Pointer$.base| 1)) (.cse3 (div (* (- 1) |ldv_malloc_#in~size|) 4))) (or (< (+ 16777215 .cse3) 0) (not (= (select |old(#valid)| 1) 1)) (not (= (mod (* |ldv_malloc_#in~size| 3) 4) 0)) .cse0 (not (= (select .cse4 0) 0)) (not (= (select .cse4 4) 0)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse5 4) 1)) (not (= (select .cse5 0) 1)) .cse1 (forall ((|v_ULTIMATE.start_ldv_positive_~r~1#1_13| Int)) (or (< (+ |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 2147483648) 0) (and (or (not (= (+ .cse3 1) 0)) (< 0 |v_ULTIMATE.start_ldv_positive_~r~1#1_13|)) (or (not (= (+ |v_ULTIMATE.start_ldv_positive_~r~1#1_13| .cse3) 0)) (< |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 1))))) (not (= (select |old(#valid)| 0) 0)) .cse2))))) [2023-12-02 12:22:59,343 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-12-02 12:22:59,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2023-12-02 12:22:59,343 INFO L895 garLoopResultBuilder]: At program point L787-2(line 787) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| 1)) (.cse1 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) (<= 1 |#StackHeapBarrier|) (= (select .cse0 0) 0) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (= |~#ldv_global_msg_list~0.offset| 0) (= (select .cse0 4) 0) (exists ((|v_ULTIMATE.start_ldv_positive_~r~1#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 2147483648)) (or (and (<= 1 |v_ULTIMATE.start_ldv_positive_~r~1#1_13|) (= |ULTIMATE.start_ldv_positive_#res#1| |v_ULTIMATE.start_ldv_positive_~r~1#1_13|)) (and (<= |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 0) (= |ULTIMATE.start_ldv_positive_#res#1| 1))))) (= (select .cse1 0) 1) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) (= (select .cse1 4) 1))) [2023-12-02 12:22:59,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L895 garLoopResultBuilder]: At program point L780-5(lines 780 782) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse2 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215)) (.cse3 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse4 (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648))) (.cse5 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215)) (.cse6 (= |~#ldv_global_msg_list~0.base| 1)) (.cse7 (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (.cse8 (<= 0 (+ 2147483648 |ULTIMATE.start_entry_point_~len~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_free_17_~i~1#1| 0)) (and (<= 1 |ULTIMATE.start_free_17_~i~1#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L895 garLoopResultBuilder]: At program point L772-6(lines 772 775) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= (+ |ULTIMATE.start_alloc_17_~i~0#1| 1) |ULTIMATE.start_alloc_17_~len#1|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777215) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215) (<= 1 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.base| 1) (<= 1 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_alloc_17_~len#1| 16777215)) [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2023-12-02 12:22:59,345 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2023-12-02 12:22:59,346 INFO L895 garLoopResultBuilder]: At program point L765-5(lines 765 769) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648))) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777215)) (.cse4 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215)) (.cse5 (= |~#ldv_global_msg_list~0.base| 1)) (.cse6 (<= |ULTIMATE.start_alloc_17_~len#1| 16777215))) (or (and (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) .cse0 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) .cse1 .cse2 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647) .cse3 .cse4 (<= 1 |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (<= 1 |ULTIMATE.start_alloc_17_#in~len#1|) (<= 1 |ULTIMATE.start_alloc_17_~len#1|) .cse6) (and .cse0 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse1 .cse2 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse3 .cse4 (= |ULTIMATE.start_alloc_17_~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (<= 0 (+ |ULTIMATE.start_alloc_17_#in~len#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_entry_point_~len~0#1|)) .cse6))) [2023-12-02 12:22:59,346 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2023-12-02 12:22:59,346 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2023-12-02 12:22:59,347 INFO L895 garLoopResultBuilder]: At program point L790-5(lines 790 792) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse10 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse13 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215)) (.cse17 (= |~#ldv_global_msg_list~0.base| 1))) (or (let ((.cse7 (select |#memory_$Pointer$.offset| 1)) (.cse4 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse5 (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) (.cse1 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse14 (select |#memory_$Pointer$.base| 1))) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (= (select |#length| 1) 8) .cse0 (or (exists ((|v_ldv_malloc_#t~malloc12.base_55| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30| Int) (|v_#valid_100| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_55| Int) (|v_#length_72| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30| Int)) (and (let ((.cse3 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |#length| |v_#length_72|) .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.offset_55| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30|) (= |v_ldv_malloc_#t~malloc12.base_55| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30|) .cse3 (= |v_#valid_100| |#valid|)) (and .cse4 (not .cse3) .cse2 (= (store |v_#length_72| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5) |#length|) (= (select |v_#valid_100| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_100| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.base_55| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29| Int) (|v_#valid_100| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_55| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29| Int) (|v_#length_72| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse6 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |#length| |v_#length_72|) .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.offset_55| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29|) .cse6 (= |v_#valid_100| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_55| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29|)) (and .cse4 (not .cse6) .cse2 (= (store |v_#length_72| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5) |#length|) (= (select |v_#valid_100| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_100| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse7 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.base_44| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22| Int) (|v_#valid_84| (Array Int Int)) (|v_#length_59| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_44| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse8 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.offset_44| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) (= |#length| |v_#length_59|) (= |v_ldv_malloc_#t~malloc12.base_44| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|) (= |v_#valid_84| |#valid|) .cse8) (and .cse4 (not .cse8) .cse2 (= (select |v_#valid_84| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_84| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_59| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5))))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_ldv_malloc_#t~malloc12.base_44| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_84| (Array Int Int)) (|v_#length_59| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_44| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse9 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse9) .cse2 (= (select |v_#valid_84| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_84| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_59| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5))) (and (= |v_ldv_malloc_#t~malloc12.offset_44| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) .cse1 .cse2 (= |#length| |v_#length_59|) (= |v_#valid_84| |#valid|) .cse9 (= |v_ldv_malloc_#t~malloc12.base_44| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse10 (= (select .cse7 4) 0) (or (exists ((|v_#length_38| (Array Int Int)) (|v_#valid_56| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse11) (= (store |v_#valid_56| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_38| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5)) .cse2 (= (select |v_#valid_56| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4| |v_ldv_malloc_#t~malloc12.base_25|) (= |v_#valid_56| |#valid|) .cse11 (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4|) (= |#length| |v_#length_38|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3| Int) (|v_#length_38| (Array Int Int)) (|v_#valid_56| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse12 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse12) (= (store |v_#valid_56| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_38| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5)) .cse2 (= (select |v_#valid_56| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3| |v_ldv_malloc_#t~malloc12.base_25|) .cse1 .cse2 (= |v_#valid_56| |#valid|) .cse12 (= |#length| |v_#length_38|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse13 (exists ((|v_ULTIMATE.start_ldv_positive_~r~1#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 2147483648)) (or (and (<= 1 |v_ULTIMATE.start_ldv_positive_~r~1#1_13|) (= |ULTIMATE.start_ldv_positive_#res#1| |v_ULTIMATE.start_ldv_positive_~r~1#1_13|)) (and (<= |v_ULTIMATE.start_ldv_positive_~r~1#1_13| 0) (= |ULTIMATE.start_ldv_positive_#res#1| 1))))) (= (select .cse14 0) 1) (= (select |#valid| 1) 1) (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_43| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_14| Int) (|v_ldv_malloc_#t~malloc12.offset_14| Int) (|v_#length_25| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse15 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse15) .cse2 (= (store |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_25| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5) |#length|)) (and .cse1 .cse2 (= |#length| |v_#length_25|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_14|) (= |v_#valid_43| |#valid|) .cse15 (= |v_ldv_malloc_#t~malloc12.offset_14| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_#valid_43| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_14| Int) (|v_ldv_malloc_#t~malloc12.offset_14| Int) (|v_#length_25| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse16) .cse2 (= (store |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_25| |ULTIMATE.start_entry_point_~array~0#1.base| .cse5) |#length|)) (and .cse1 .cse2 (= |#length| |v_#length_25|) (= |v_#valid_43| |#valid|) .cse16 (= |v_ldv_malloc_#t~malloc12.offset_14| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_14|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse17 (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) (= (select .cse14 4) 1))) (and (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) .cse0 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) .cse10 (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648)) .cse13 .cse17 (<= 0 (+ 2147483648 |ULTIMATE.start_entry_point_~len~0#1|))))) [2023-12-02 12:22:59,348 INFO L895 garLoopResultBuilder]: At program point L766(line 766) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_#res#1| 2147483648))) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777215)) (.cse4 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777215)) (.cse5 (= |~#ldv_global_msg_list~0.base| 1)) (.cse6 (<= |ULTIMATE.start_alloc_17_~len#1| 16777215))) (or (and (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) .cse0 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777215) .cse1 .cse2 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= (+ |ULTIMATE.start_alloc_17_~i~0#1| 1) |ULTIMATE.start_alloc_17_~len#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (<= 1 |ULTIMATE.start_alloc_17_#in~len#1|) .cse6) (and .cse0 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse1 .cse2 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse3 .cse4 (= |ULTIMATE.start_alloc_17_~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (<= 0 (+ |ULTIMATE.start_alloc_17_#in~len#1| 2147483648)) (<= 1 |ULTIMATE.start_alloc_17_~len#1|) .cse6))) [2023-12-02 12:22:59,348 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2023-12-02 12:22:59,348 INFO L899 garLoopResultBuilder]: For program point alloc_17_err#1(lines 761 777) no Hoare annotation was computed. [2023-12-02 12:22:59,348 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2023-12-02 12:22:59,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,348 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2023-12-02 12:22:59,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 12:22:59,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,349 INFO L899 garLoopResultBuilder]: For program point alloc_17_returnLabel#1(lines 761 777) no Hoare annotation was computed. [2023-12-02 12:22:59,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2023-12-02 12:22:59,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2023-12-02 12:22:59,353 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:59,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 12:22:59,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 12:22:59,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_55 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30 : int, v_#valid_100 : [int]int, v_ldv_malloc_#t~malloc12.offset_55 : int, v_#length_72 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30 : int :: ((((((((#length == v_#length_72 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_55 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30) && v_ldv_malloc_#t~malloc12.base_55 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_100 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_72[~array~0!base := ~len~0 % 1073741824 * 4] == #length) && v_#valid_100[~array~0!base] == 0) && v_#valid_100[~array~0!base := 1] == #valid)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_55 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29 : int, v_#valid_100 : [int]int, v_ldv_malloc_#t~malloc12.offset_55 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29 : int, v_#length_72 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_72 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_55 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_100 == #valid) && v_ldv_malloc_#t~malloc12.base_55 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_72[~array~0!base := ~len~0 % 1073741824 * 4] == #length) && v_#valid_100[~array~0!base] == 0) && v_#valid_100[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-12-02 12:22:59,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_44 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_#valid_84 : [int]int, v_#length_59 : [int]int, v_ldv_malloc_#t~malloc12.offset_44 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_44 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && #length == v_#length_59) && v_ldv_malloc_#t~malloc12.base_44 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22) && v_#valid_84 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_84[~array~0!base] == 0) && v_#valid_84[~array~0!base := 1] == #valid) && #length == v_#length_59[~array~0!base := ~len~0 % 1073741824 * 4]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~malloc12.base_44 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_84 : [int]int, v_#length_59 : [int]int, v_ldv_malloc_#t~malloc12.offset_44 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_84[~array~0!base] == 0) && v_#valid_84[~array~0!base := 1] == #valid) && #length == v_#length_59[~array~0!base := ~len~0 % 1073741824 * 4]) || ((((((v_ldv_malloc_#t~malloc12.offset_44 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_59) && v_#valid_84 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_44 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-12-02 12:22:59,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_38 : [int]int, v_#valid_56 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_56[~array~0!base := 1] == #valid) && #length == v_#length_38[~array~0!base := ~len~0 % 1073741824 * 4]) && ~array~0!offset == 0) && v_#valid_56[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 == v_ldv_malloc_#t~malloc12.base_25) && v_#valid_56 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4) && #length == v_#length_38))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 : int, v_#length_38 : [int]int, v_#valid_56 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_56[~array~0!base := 1] == #valid) && #length == v_#length_38[~array~0!base := ~len~0 % 1073741824 * 4]) && ~array~0!offset == 0) && v_#valid_56[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 == v_ldv_malloc_#t~malloc12.base_25) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_56 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_38))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_ldv_positive_~r~1#1_13 : int :: 0 <= v_ULTIMATE.start_ldv_positive_~r~1#1_13 + 2147483648 && ((1 <= v_ULTIMATE.start_ldv_positive_~r~1#1_13 && #res == v_ULTIMATE.start_ldv_positive_~r~1#1_13) || (v_ULTIMATE.start_ldv_positive_~r~1#1_13 <= 0 && #res == 1))) could not be translated [2023-12-02 12:22:59,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-12-02 12:22:59,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 12:22:59,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_25 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && v_#length_25[~array~0!base := ~len~0 % 1073741824 * 4] == #length) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_25) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_25 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && v_#length_25[~array~0!base := ~len~0 % 1073741824 * 4] == #length) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_25) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 12:22:59,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 12:22:59,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-12-02 12:22:59,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:22:59 BoogieIcfgContainer [2023-12-02 12:22:59,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 12:22:59,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 12:22:59,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 12:22:59,394 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 12:22:59,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:22:13" (3/4) ... [2023-12-02 12:22:59,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 12:22:59,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-12-02 12:22:59,409 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2023-12-02 12:22:59,409 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-12-02 12:22:59,410 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-12-02 12:22:59,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((i == 0) && (\result <= 16777215)) && (\result == len)) || (((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (0 <= (2147483648 + len)))) [2023-12-02 12:22:59,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (j + 1))) && (0 <= (\result + 2147483648))) && (0 <= i)) && ((i + 1) <= len)) && (j <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (len <= 16777215)) [2023-12-02 12:22:59,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (0 <= i)) && (i <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (1 <= len)) && (len <= 16777215)) || (((((((((0 <= i) && (0 <= (\result + 2147483648))) && (i == 0)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (len == len)) && (0 <= (\old(len) + 2147483648))) && (0 <= (2147483648 + len))) && (len <= 16777215))) [2023-12-02 12:22:59,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len))) && (i == 0)) || (((((((1 <= i) && (0 <= i)) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len)))) [2023-12-02 12:22:59,467 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((i == 0) && (\result <= 16777215)) && (\result == len)) || (((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (0 <= (2147483648 + len)))) [2023-12-02 12:22:59,467 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (j + 1))) && (0 <= (\result + 2147483648))) && (0 <= i)) && ((i + 1) <= len)) && (j <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (len <= 16777215)) [2023-12-02 12:22:59,467 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (0 <= i)) && (i <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (1 <= len)) && (len <= 16777215)) || (((((((((0 <= i) && (0 <= (\result + 2147483648))) && (i == 0)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (len == len)) && (0 <= (\old(len) + 2147483648))) && (0 <= (2147483648 + len))) && (len <= 16777215))) [2023-12-02 12:22:59,468 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len))) && (i == 0)) || (((((((1 <= i) && (0 <= i)) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len)))) [2023-12-02 12:22:59,523 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 12:22:59,523 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 12:22:59,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 12:22:59,524 INFO L158 Benchmark]: Toolchain (without parser) took 47860.66ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 167.2MB in the beginning and 225.3MB in the end (delta: -58.1MB). Peak memory consumption was 253.1MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,524 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 121.6MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:22:59,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.43ms. Allocated memory is still 203.4MB. Free memory was 167.2MB in the beginning and 162.1MB in the end (delta: 5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.97ms. Allocated memory is still 203.4MB. Free memory was 162.1MB in the beginning and 160.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,525 INFO L158 Benchmark]: Boogie Preprocessor took 37.29ms. Allocated memory is still 203.4MB. Free memory was 160.0MB in the beginning and 158.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,526 INFO L158 Benchmark]: RCFGBuilder took 557.35ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 138.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,526 INFO L158 Benchmark]: TraceAbstraction took 46352.41ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 138.1MB in the beginning and 230.6MB in the end (delta: -92.4MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,527 INFO L158 Benchmark]: Witness Printer took 129.23ms. Allocated memory is still 513.8MB. Free memory was 230.6MB in the beginning and 225.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 12:22:59,529 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.24ms. Allocated memory is still 121.6MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.43ms. Allocated memory is still 203.4MB. Free memory was 167.2MB in the beginning and 162.1MB in the end (delta: 5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.97ms. Allocated memory is still 203.4MB. Free memory was 162.1MB in the beginning and 160.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.29ms. Allocated memory is still 203.4MB. Free memory was 160.0MB in the beginning and 158.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.35ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 138.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 46352.41ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 138.1MB in the beginning and 230.6MB in the end (delta: -92.4MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. * Witness Printer took 129.23ms. Allocated memory is still 513.8MB. Free memory was 230.6MB in the beginning and 225.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_55 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30 : int, v_#valid_100 : [int]int, v_ldv_malloc_#t~malloc12.offset_55 : int, v_#length_72 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30 : int :: ((((((((#length == v_#length_72 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_55 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_30) && v_ldv_malloc_#t~malloc12.base_55 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_30) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_100 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_72[~array~0!base := ~len~0 % 1073741824 * 4] == #length) && v_#valid_100[~array~0!base] == 0) && v_#valid_100[~array~0!base := 1] == #valid)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_55 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29 : int, v_#valid_100 : [int]int, v_ldv_malloc_#t~malloc12.offset_55 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29 : int, v_#length_72 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_72 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_55 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_29) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_100 == #valid) && v_ldv_malloc_#t~malloc12.base_55 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_29) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_72[~array~0!base := ~len~0 % 1073741824 * 4] == #length) && v_#valid_100[~array~0!base] == 0) && v_#valid_100[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_44 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_#valid_84 : [int]int, v_#length_59 : [int]int, v_ldv_malloc_#t~malloc12.offset_44 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_44 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && #length == v_#length_59) && v_ldv_malloc_#t~malloc12.base_44 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22) && v_#valid_84 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_84[~array~0!base] == 0) && v_#valid_84[~array~0!base := 1] == #valid) && #length == v_#length_59[~array~0!base := ~len~0 % 1073741824 * 4]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~malloc12.base_44 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_84 : [int]int, v_#length_59 : [int]int, v_ldv_malloc_#t~malloc12.offset_44 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_84[~array~0!base] == 0) && v_#valid_84[~array~0!base := 1] == #valid) && #length == v_#length_59[~array~0!base := ~len~0 % 1073741824 * 4]) || ((((((v_ldv_malloc_#t~malloc12.offset_44 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_59) && v_#valid_84 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_44 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_38 : [int]int, v_#valid_56 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_56[~array~0!base := 1] == #valid) && #length == v_#length_38[~array~0!base := ~len~0 % 1073741824 * 4]) && ~array~0!offset == 0) && v_#valid_56[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 == v_ldv_malloc_#t~malloc12.base_25) && v_#valid_56 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4) && #length == v_#length_38))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 : int, v_#length_38 : [int]int, v_#valid_56 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_56[~array~0!base := 1] == #valid) && #length == v_#length_38[~array~0!base := ~len~0 % 1073741824 * 4]) && ~array~0!offset == 0) && v_#valid_56[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 == v_ldv_malloc_#t~malloc12.base_25) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_56 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_38))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_ldv_positive_~r~1#1_13 : int :: 0 <= v_ULTIMATE.start_ldv_positive_~r~1#1_13 + 2147483648 && ((1 <= v_ULTIMATE.start_ldv_positive_~r~1#1_13 && #res == v_ULTIMATE.start_ldv_positive_~r~1#1_13) || (v_ULTIMATE.start_ldv_positive_~r~1#1_13 <= 0 && #res == 1))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_25 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && v_#length_25[~array~0!base := ~len~0 % 1073741824 * 4] == #length) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_25) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_25 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && v_#length_25[~array~0!base := ~len~0 % 1073741824 * 4] == #length) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_25) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated * 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: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: 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 2 procedures, 36 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 46.3s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 1402 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 352 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 367 SyntacticMatches, 33 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=13, InterpolantAutomatonStates: 125, 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, 84 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 36 NumberOfFragments, 1219 HoareAnnotationTreeSize, 13 FomulaSimplifications, 4713 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3132 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 504 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 1362 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 232/287 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: 7.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 76, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 135, TOOLS_POST_TIME: 4.1s, TOOLS_POST_CALL_APPLICATIONS: 37, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 1.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 202, TOOLS_QUANTIFIERELIM_TIME: 6.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 300, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 33, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 10, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 76, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 4.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, CALL_SUMMARIZER_APPLICATIONS: 30, 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.0s, DAG_COMPRESSION_PROCESSED_NODES: 1003, DAG_COMPRESSION_RETAINED_NODES: 234, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 765]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (0 <= i)) && (i <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (1 <= len)) && (len <= 16777215)) || (((((((((0 <= i) && (0 <= (\result + 2147483648))) && (i == 0)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (len == len)) && (0 <= (\old(len) + 2147483648))) && (0 <= (2147483648 + len))) && (len <= 16777215))) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((0 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len))) && (i == 0)) || (((((((1 <= i) && (0 <= i)) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (len <= 16777215)) && (0 <= (2147483648 + len)))) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i) && (len <= 16777215)) && (0 <= (j + 1))) && (0 <= (\result + 2147483648))) && (0 <= i)) && ((i + 1) <= len)) && (j <= 2147483647)) && (\old(len) <= 16777215)) && (\result <= 16777215)) && (1 <= len)) && (1 <= \old(len))) && (len <= 16777215)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: ((((i == 0) && (\result <= 16777215)) && (\result == len)) || (((((1 <= i) && (len <= 16777215)) && (0 <= (\result + 2147483648))) && (\result <= 16777215)) && (0 <= (2147483648 + len)))) RESULT: Ultimate proved your program to be correct! [2023-12-02 12:22:59,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_102875dc-c299-4bcb-8136-6869fa90f5cb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE