./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.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_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:54:36,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:54:36,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-24 23:54:36,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:54:36,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:54:36,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:54:36,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:54:36,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:54:36,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:54:36,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:54:36,292 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:54:36,292 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:54:36,293 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:54:36,293 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:54:36,294 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:54:36,294 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:54:36,295 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:54:36,295 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:54:36,296 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:54:36,296 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:54:36,297 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:54:36,304 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:54:36,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:54:36,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:54:36,306 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:54:36,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:54:36,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:54:36,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:54:36,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:54:36,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:54:36,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:54:36,309 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-24 23:54:36,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:54:36,310 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:54:36,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:54:36,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:54:36,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:54:36,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:54:36,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:54:36,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:54:36,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:54:36,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:54:36,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:54:36,316 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:54:36,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:54:36,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:54:36,317 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:54:36,318 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:54:36,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:54:36,318 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_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2023-11-24 23:54:36,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:54:36,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:54:36,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:54:36,637 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:54:36,638 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:54:36,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2023-11-24 23:54:39,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:54:40,113 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:54:40,114 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2023-11-24 23:54:40,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/data/3b3753473/28ebc4432b584528908ae6f624790b71/FLAG637c8f997 [2023-11-24 23:54:40,155 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/data/3b3753473/28ebc4432b584528908ae6f624790b71 [2023-11-24 23:54:40,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:54:40,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:54:40,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:54:40,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:54:40,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:54:40,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:54:40" (1/1) ... [2023-11-24 23:54:40,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295ca908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:40, skipping insertion in model container [2023-11-24 23:54:40,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:54:40" (1/1) ... [2023-11-24 23:54:40,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:54:40,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:54:40,849 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:54:40,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:54:40,998 WARN L675 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 23:54:41,006 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:54:41,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41 WrapperNode [2023-11-24 23:54:41,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:54:41,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:54:41,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:54:41,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:54:41,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,113 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 51 [2023-11-24 23:54:41,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:54:41,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:54:41,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:54:41,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:54:41,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:54:41,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:54:41,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:54:41,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:54:41,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (1/1) ... [2023-11-24 23:54:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:54:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:41,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:54:41,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:54:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-24 23:54:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-24 23:54:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:54:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:54:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:54:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:54:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:54:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:54:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:54:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:54:41,412 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:54:41,418 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:54:41,612 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:54:41,697 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:54:41,697 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:54:41,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:54:41 BoogieIcfgContainer [2023-11-24 23:54:41,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:54:41,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:54:41,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:54:41,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:54:41,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:54:40" (1/3) ... [2023-11-24 23:54:41,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517e2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:54:41, skipping insertion in model container [2023-11-24 23:54:41,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:41" (2/3) ... [2023-11-24 23:54:41,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517e2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:54:41, skipping insertion in model container [2023-11-24 23:54:41,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:54:41" (3/3) ... [2023-11-24 23:54:41,710 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18.i [2023-11-24 23:54:41,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:54:41,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-24 23:54:41,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:54:41,795 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;@39b455c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:54:41,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 23:54:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 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-11-24 23:54:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 23:54:41,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:41,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:41,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:41,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1695914094, now seen corresponding path program 1 times [2023-11-24 23:54:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:41,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739772479] [2023-11-24 23:54:41,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:42,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739772479] [2023-11-24 23:54:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739772479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:42,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:54:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576152496] [2023-11-24 23:54:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:42,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:54:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:54:42,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:54:42,274 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 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, 4 states have (on average 1.5) 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-11-24 23:54:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:42,391 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-24 23:54:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:54:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-11-24 23:54:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:42,402 INFO L225 Difference]: With dead ends: 51 [2023-11-24 23:54:42,402 INFO L226 Difference]: Without dead ends: 38 [2023-11-24 23:54:42,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:54:42,410 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:42,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:54:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-24 23:54:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-11-24 23:54:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-24 23:54:42,459 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 8 [2023-11-24 23:54:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:42,460 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-24 23:54:42,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-11-24 23:54:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-24 23:54:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 23:54:42,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:42,463 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:54:42,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:42,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1160026096, now seen corresponding path program 1 times [2023-11-24 23:54:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535080047] [2023-11-24 23:54:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:42,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535080047] [2023-11-24 23:54:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535080047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:54:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405034900] [2023-11-24 23:54:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:42,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:54:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:54:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:54:42,687 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-24 23:54:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:42,743 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-24 23:54:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:54:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 13 [2023-11-24 23:54:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:42,745 INFO L225 Difference]: With dead ends: 38 [2023-11-24 23:54:42,745 INFO L226 Difference]: Without dead ends: 36 [2023-11-24 23:54:42,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:54:42,747 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:42,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:54:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-24 23:54:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-11-24 23:54:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-24 23:54:42,755 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2023-11-24 23:54:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:42,756 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-24 23:54:42,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-24 23:54:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-24 23:54:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:54:42,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:42,758 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:42,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:54:42,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:42,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1030627210, now seen corresponding path program 1 times [2023-11-24 23:54:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921209344] [2023-11-24 23:54:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:42,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921209344] [2023-11-24 23:54:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921209344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117842332] [2023-11-24 23:54:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:42,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:42,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:54:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:43,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 23:54:43,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:43,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:54:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117842332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:54:43,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-24 23:54:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776824841] [2023-11-24 23:54:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:43,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:54:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:54:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:54:43,117 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-11-24 23:54:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:43,220 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-24 23:54:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 16 [2023-11-24 23:54:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:43,224 INFO L225 Difference]: With dead ends: 36 [2023-11-24 23:54:43,224 INFO L226 Difference]: Without dead ends: 34 [2023-11-24 23:54:43,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:54:43,228 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:43,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:54:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-24 23:54:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-11-24 23:54:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-24 23:54:43,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2023-11-24 23:54:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:43,241 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-24 23:54:43,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-11-24 23:54:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-24 23:54:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:54:43,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:43,242 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:43,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:43,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:43,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 987436970, now seen corresponding path program 1 times [2023-11-24 23:54:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352327519] [2023-11-24 23:54:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:43,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352327519] [2023-11-24 23:54:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352327519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:54:43,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850693432] [2023-11-24 23:54:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:54:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:43,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:54:43,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:54:43,562 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-24 23:54:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:43,605 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-24 23:54:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:54:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 16 [2023-11-24 23:54:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:43,606 INFO L225 Difference]: With dead ends: 35 [2023-11-24 23:54:43,607 INFO L226 Difference]: Without dead ends: 27 [2023-11-24 23:54:43,607 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-11-24 23:54:43,608 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:43,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:54:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-24 23:54:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-24 23:54:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-24 23:54:43,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-11-24 23:54:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:43,619 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-24 23:54:43,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-24 23:54:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-24 23:54:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:54:43,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:43,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:43,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:54:43,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:43,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1884672509, now seen corresponding path program 1 times [2023-11-24 23:54:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370617645] [2023-11-24 23:54:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:43,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:43,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370617645] [2023-11-24 23:54:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370617645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177671958] [2023-11-24 23:54:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:43,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:43,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:54:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:43,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 23:54:43,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:43,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:54:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177671958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:43,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:54:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-24 23:54:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942753849] [2023-11-24 23:54:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:54:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:54:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:43,946 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-24 23:54:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:43,967 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-24 23:54:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:54:43,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17 [2023-11-24 23:54:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:43,970 INFO L225 Difference]: With dead ends: 27 [2023-11-24 23:54:43,970 INFO L226 Difference]: Without dead ends: 26 [2023-11-24 23:54:43,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:43,972 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:43,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:54:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-24 23:54:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-24 23:54:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-24 23:54:43,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2023-11-24 23:54:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:43,984 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-24 23:54:43,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-24 23:54:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-24 23:54:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:54:43,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:43,985 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:43,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:44,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:44,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1305914394, now seen corresponding path program 1 times [2023-11-24 23:54:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091443399] [2023-11-24 23:54:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:54:44,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091443399] [2023-11-24 23:54:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091443399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:44,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:54:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763125744] [2023-11-24 23:54:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:44,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:54:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:54:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:54:44,308 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-11-24 23:54:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:44,329 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-24 23:54:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:54:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 19 [2023-11-24 23:54:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:44,331 INFO L225 Difference]: With dead ends: 26 [2023-11-24 23:54:44,331 INFO L226 Difference]: Without dead ends: 25 [2023-11-24 23:54:44,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:54:44,332 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:44,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:54:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-24 23:54:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-24 23:54:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-24 23:54:44,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2023-11-24 23:54:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:44,339 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-24 23:54:44,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-11-24 23:54:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-24 23:54:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 23:54:44,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:44,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:44,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:54:44,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:44,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1828640465, now seen corresponding path program 1 times [2023-11-24 23:54:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404388024] [2023-11-24 23:54:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:44,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404388024] [2023-11-24 23:54:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404388024] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775782956] [2023-11-24 23:54:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:44,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:44,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:54:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:44,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:54:44,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:44,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:54:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775782956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860714713] [2023-11-24 23:54:44,731 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:54:44,731 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:54:44,734 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:54:44,740 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:54:44,740 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:54:46,607 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:54:46,641 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:54:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [860714713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:48,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:48,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:54:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521184673] [2023-11-24 23:54:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:48,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:54:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:54:48,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-11-24 23:54:48,161 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-11-24 23:54:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:49,740 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-11-24 23:54:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:54:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 20 [2023-11-24 23:54:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:49,741 INFO L225 Difference]: With dead ends: 35 [2023-11-24 23:54:49,741 INFO L226 Difference]: Without dead ends: 33 [2023-11-24 23:54:49,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=151, Invalid=718, Unknown=1, NotChecked=0, Total=870 [2023-11-24 23:54:49,743 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:49,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 56 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:54:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-24 23:54:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2023-11-24 23:54:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-24 23:54:49,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2023-11-24 23:54:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:49,752 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-24 23:54:49,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-11-24 23:54:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-24 23:54:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:54:49,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:49,754 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] [2023-11-24 23:54:49,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:49,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:49,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:49,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 337194173, now seen corresponding path program 1 times [2023-11-24 23:54:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461615454] [2023-11-24 23:54:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:54:50,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461615454] [2023-11-24 23:54:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461615454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017473630] [2023-11-24 23:54:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:50,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:50,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:54:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:50,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:54:50,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:54:50,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:54:50,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017473630] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:50,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [904104809] [2023-11-24 23:54:50,278 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:54:50,278 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:54:50,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:54:50,279 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:54:50,279 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:54:51,500 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:54:51,535 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:54:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [904104809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:54:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940338498] [2023-11-24 23:54:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:54:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:54:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-11-24 23:54:52,918 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-11-24 23:54:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:54,292 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-24 23:54:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:54:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 23 [2023-11-24 23:54:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:54,294 INFO L225 Difference]: With dead ends: 31 [2023-11-24 23:54:54,294 INFO L226 Difference]: Without dead ends: 22 [2023-11-24 23:54:54,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=718, Unknown=1, NotChecked=0, Total=870 [2023-11-24 23:54:54,295 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:54,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:54:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-24 23:54:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-24 23:54:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-24 23:54:54,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 23 [2023-11-24 23:54:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:54,304 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-24 23:54:54,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-11-24 23:54:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-24 23:54:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 23:54:54,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:54,306 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:54,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:54,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:54,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1646291377, now seen corresponding path program 1 times [2023-11-24 23:54:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:54,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335272153] [2023-11-24 23:54:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:54,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335272153] [2023-11-24 23:54:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335272153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345862983] [2023-11-24 23:54:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:54,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:54,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:54,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:54,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:54:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:54,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 23:54:54,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:54,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:54,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345862983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:54,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824426384] [2023-11-24 23:54:54,871 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:54:54,872 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:54:54,872 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:54:54,872 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:54:54,872 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:54:55,893 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:54:55,919 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:54:57,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [824426384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:57,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:54:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91736866] [2023-11-24 23:54:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:57,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:54:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:57,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:54:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2023-11-24 23:54:57,316 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-11-24 23:54:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:58,639 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-24 23:54:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:54:58,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-11-24 23:54:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:58,640 INFO L225 Difference]: With dead ends: 26 [2023-11-24 23:54:58,640 INFO L226 Difference]: Without dead ends: 25 [2023-11-24 23:54:58,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=968, Unknown=1, NotChecked=0, Total=1122 [2023-11-24 23:54:58,642 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:58,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 23 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:54:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-24 23:54:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-24 23:54:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:54:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-24 23:54:58,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 25 [2023-11-24 23:54:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:58,652 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-24 23:54:58,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-11-24 23:54:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-24 23:54:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:54:58,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:58,653 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] [2023-11-24 23:54:58,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 23:54:58,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:58,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:54:58,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash -434754659, now seen corresponding path program 1 times [2023-11-24 23:54:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866725107] [2023-11-24 23:54:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:59,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866725107] [2023-11-24 23:54:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866725107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641386558] [2023-11-24 23:54:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:59,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:59,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:59,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:59,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:54:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:59,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 23:54:59,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:59,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:54:59,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641386558] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185545819] [2023-11-24 23:54:59,228 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:54:59,228 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:54:59,228 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:54:59,229 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:54:59,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:55:00,213 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:55:00,237 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:55:01,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [185545819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:01,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:01,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8, 8] total 22 [2023-11-24 23:55:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312633] [2023-11-24 23:55:01,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:01,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:55:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:55:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-24 23:55:01,634 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-11-24 23:55:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:03,005 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-11-24 23:55:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:55:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 28 [2023-11-24 23:55:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:03,006 INFO L225 Difference]: With dead ends: 25 [2023-11-24 23:55:03,006 INFO L226 Difference]: Without dead ends: 0 [2023-11-24 23:55:03,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=108, Invalid=761, Unknown=1, NotChecked=0, Total=870 [2023-11-24 23:55:03,008 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:03,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:55:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-24 23:55:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-24 23:55:03,009 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-11-24 23:55:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-24 23:55:03,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-11-24 23:55:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:03,009 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-24 23:55:03,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-11-24 23:55:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-24 23:55:03,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-24 23:55:03,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-24 23:55:03,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-24 23:55:03,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-24 23:55:03,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-24 23:55:03,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-24 23:55:03,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-24 23:55:03,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:03,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-24 23:55:04,951 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (let ((.cse3 (not (= |ldv_malloc_#in~size| 4)))) (or (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 (= 40 |ldv_malloc_#in~size|)) .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse5 (select |#memory_$Pointer$.base| 1))) (or (not (= (select |old(#valid)| 1) 1)) (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)) (not (= (select |old(#valid)| 0) 0)))) .cse3))) [2023-11-24 23:55:04,951 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-11-24 23:55:04,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,951 INFO L895 garLoopResultBuilder]: At program point L762(line 762) 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) (= |~#ldv_global_msg_list~0.offset| 0) (= (select .cse0 4) 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= (select .cse1 0) 1) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= (select .cse1 4) 1))) [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point L763(lines 763 777) no Hoare annotation was computed. [2023-11-24 23:55:04,952 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2023-11-24 23:55:04,953 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse12 (= |~#ldv_global_msg_list~0.base| 1))) (or (let ((.cse1 (select |#memory_$Pointer$.offset| 1)) (.cse4 (select |#memory_$Pointer$.base| 1)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse8 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse1 0) 0) .cse2 (= (select .cse1 4) 0) .cse3 (= (select .cse4 0) 1) (= (select |#valid| 1) 1) (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (let ((.cse7 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse7 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse8 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse7) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse6))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse9 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) .cse5 .cse6 .cse9 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse8 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse9) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse6))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (or (exists ((|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int))) (and (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse10) .cse6 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_49|) .cse5 (= |v_#valid_70| |#valid|) .cse6 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) .cse10 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse11) .cse6 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse5 (= |v_#valid_70| |#valid|) .cse6 .cse11 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse12 (= (select |#valid| 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse13 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse13) .cse6 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse5 .cse6 (= |#length| |v_#length_62|) .cse13 (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse14 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse14) .cse6 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) .cse5 .cse6 (= |#length| |v_#length_62|) .cse14 (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse4 4) 1) (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (let ((.cse15 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_17|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|) .cse5 .cse6 (= |#length| |v_#length_26|) .cse15 (= |v_#valid_39| |#valid|)) (and .cse8 (not .cse15) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse6 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |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.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse16 (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_#valid_39| |#valid|)) (and .cse8 (not .cse16) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse6 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))))) (and .cse0 .cse2 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse3 .cse12 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|)))) [2023-11-24 23:55:04,953 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 760 779) no Hoare annotation was computed. [2023-11-24 23:55:04,953 INFO L899 garLoopResultBuilder]: For program point L772(lines 763 777) no Hoare annotation was computed. [2023-11-24 23:55:04,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-24 23:55:04,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-24 23:55:04,955 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)) (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse5 (select |#memory_$Pointer$.base| 1)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse9 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse4 0) 0) .cse1 (= (select .cse4 4) 0) .cse2 (= (select .cse5 0) 1) (= (select |#valid| 1) 1) (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (let ((.cse8 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 .cse7 (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse8 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse9 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse8) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse7))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) .cse6 .cse7 .cse10 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse9 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse10) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse7))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (or (exists ((|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int))) (and (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse11) .cse7 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_49|) .cse6 (= |v_#valid_70| |#valid|) .cse7 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) .cse11 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse12 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse12) .cse7 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse6 (= |v_#valid_70| |#valid|) .cse7 .cse12 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse3 (= (select |#valid| 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse13 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse13) .cse7 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse6 .cse7 (= |#length| |v_#length_62|) .cse13 (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse14 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse14) .cse7 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) .cse6 .cse7 (= |#length| |v_#length_62|) .cse14 (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse5 4) 1) (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (let ((.cse15 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_17|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|) .cse6 .cse7 (= |#length| |v_#length_26|) .cse15 (= |v_#valid_39| |#valid|)) (and .cse9 (not .cse15) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse7 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |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.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 .cse7 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse16 (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_#valid_39| |#valid|)) (and .cse9 (not .cse16) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse7 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))))))) [2023-11-24 23:55:04,955 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2023-11-24 23:55:04,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,955 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-24 23:55:04,956 INFO L899 garLoopResultBuilder]: For program point L773(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,956 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2023-11-24 23:55:04,956 INFO L899 garLoopResultBuilder]: For program point L773-4(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,956 INFO L899 garLoopResultBuilder]: For program point L773-5(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,956 INFO L895 garLoopResultBuilder]: At program point L773-6(lines 773 775) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1))) (or (and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= (+ |ULTIMATE.start_entry_point_~j~0#1| 1) 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) .cse2 .cse3 (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483647) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)) (and .cse0 (<= 10 |ULTIMATE.start_entry_point_~i~0#1|) .cse1 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse2 .cse3 (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483646)))) [2023-11-24 23:55:04,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:55:04,960 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:04,962 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 23:55:04,979 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-24 23:55:04,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-24 23:55:04,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-24 23:55:04,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-24 23:55:04,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-24 23:55:04,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-24 23:55:04,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [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_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [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_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-24 23:55:04,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_17 && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_39 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_39[~array~0!base] == 0) && v_#valid_39[~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-11-24 23:55:04,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_17) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:55:04,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 11:55:04 BoogieIcfgContainer [2023-11-24 23:55:04,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 23:55:04,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 23:55:04,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 23:55:04,989 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 23:55:04,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:54:41" (3/4) ... [2023-11-24 23:55:04,992 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 23:55:04,995 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-24 23:55:04,999 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-24 23:55:05,000 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-24 23:55:05,000 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-24 23:55:05,089 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-24 23:55:05,089 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/witness.yml [2023-11-24 23:55:05,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 23:55:05,090 INFO L158 Benchmark]: Toolchain (without parser) took 24927.48ms. Allocated memory was 144.7MB in the beginning and 358.6MB in the end (delta: 213.9MB). Free memory was 98.4MB in the beginning and 288.5MB in the end (delta: -190.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,090 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 144.7MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:55:05,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.06ms. Allocated memory is still 144.7MB. Free memory was 98.4MB in the beginning and 75.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.14ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 115.0MB in the end (delta: -39.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,093 INFO L158 Benchmark]: Boogie Preprocessor took 53.03ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 115.0MB in the beginning and 166.7MB in the end (delta: -51.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,093 INFO L158 Benchmark]: RCFGBuilder took 531.13ms. Allocated memory is still 195.0MB. Free memory was 166.7MB in the beginning and 152.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,094 INFO L158 Benchmark]: TraceAbstraction took 23285.88ms. Allocated memory was 195.0MB in the beginning and 358.6MB in the end (delta: 163.6MB). Free memory was 152.1MB in the beginning and 292.7MB in the end (delta: -140.6MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,094 INFO L158 Benchmark]: Witness Printer took 100.43ms. Allocated memory is still 358.6MB. Free memory was 292.7MB in the beginning and 288.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 23:55:05,098 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.23ms. Allocated memory is still 144.7MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.06ms. Allocated memory is still 144.7MB. Free memory was 98.4MB in the beginning and 75.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.14ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 115.0MB in the end (delta: -39.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.03ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 115.0MB in the beginning and 166.7MB in the end (delta: -51.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 531.13ms. Allocated memory is still 195.0MB. Free memory was 166.7MB in the beginning and 152.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23285.88ms. Allocated memory was 195.0MB in the beginning and 358.6MB in the end (delta: 163.6MB). Free memory was 152.1MB in the beginning and 292.7MB in the end (delta: -140.6MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. * Witness Printer took 100.43ms. Allocated memory is still 358.6MB. Free memory was 292.7MB in the beginning and 288.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] 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_11 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && 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.offset_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && 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.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == 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 #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [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_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 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_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [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_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] 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~malloc12.offset_17 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_17 && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_39 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_39[~array~0!base] == 0) && v_#valid_39[~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.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_17) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) 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: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: 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, 25 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 814 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 124 mSDtfsCounter, 814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 230 SyntacticMatches, 22 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 1390 HoareAnnotationTreeSize, 7 FomulaSimplifications, 653 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 13 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 83/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 5.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 88, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 143, TOOLS_POST_TIME: 1.5s, TOOLS_POST_CALL_APPLICATIONS: 48, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 1.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 231, TOOLS_QUANTIFIERELIM_TIME: 4.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 319, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 42, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 17, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 88, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 1.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 17, CALL_SUMMARIZER_APPLICATIONS: 40, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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: 1200, DAG_COMPRESSION_RETAINED_NODES: 238, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((10 == len) && (i == 0)) || (((i <= 2147483647) && (10 == len)) && (1 <= i))) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((10 <= len) && ((j + 1) <= 0)) && (i == 0)) || ((((0 <= i) && (10 == len)) && (j <= 2147483647)) && (i <= 9))) || ((((10 <= i) && (i <= 2147483647)) && (10 == len)) && (j <= 2147483646))) RESULT: Ultimate proved your program to be correct! [2023-11-24 23:55:05,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f21efc-88af-41dc-a4a1-04a5d011bc88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE