./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.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_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/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_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/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_1b0819a1-6e15-4a93-b49d-32513ad61e10/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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:55:53,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:55:53,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-24 23:55:53,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:55:53,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:55:53,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:55:53,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:55:53,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:55:53,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:55:53,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:55:53,475 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:55:53,476 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:55:53,477 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:55:53,477 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:55:53,478 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:55:53,479 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:55:53,479 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:55:53,480 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:55:53,480 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:55:53,481 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:55:53,481 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:55:53,482 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:55:53,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:55:53,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:55:53,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:55:53,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:55:53,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:55:53,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:55:53,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:55:53,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:55:53,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:55:53,487 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-24 23:55:53,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:55:53,488 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:55:53,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:55:53,489 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:55:53,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:55:53,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:55:53,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:55:53,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:55:53,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:55:53,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:55:53,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:55:53,493 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:55:53,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:55:53,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:55:53,494 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:55:53,495 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:55:53,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:55:53,495 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_1b0819a1-6e15-4a93-b49d-32513ad61e10/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_1b0819a1-6e15-4a93-b49d-32513ad61e10/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 -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2023-11-24 23:55:53,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:55:53,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:55:53,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:55:53,885 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:55:53,886 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:55:53,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2023-11-24 23:55:57,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:55:57,338 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:55:57,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2023-11-24 23:55:57,363 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/data/91a6685da/c45ec88f8852422b8846a7fa674c0851/FLAGf3381de6a [2023-11-24 23:55:57,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/data/91a6685da/c45ec88f8852422b8846a7fa674c0851 [2023-11-24 23:55:57,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:55:57,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:55:57,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:57,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:55:57,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:55:57,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:57" (1/1) ... [2023-11-24 23:55:57,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8bd077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:57, skipping insertion in model container [2023-11-24 23:55:57,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:57" (1/1) ... [2023-11-24 23:55:57,447 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:55:57,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:57,973 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:55:58,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:58,162 WARN L675 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 23:55:58,170 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:55:58,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58 WrapperNode [2023-11-24 23:55:58,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:58,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:58,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:55:58,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:55:58,182 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:55:58" (1/1) ... [2023-11-24 23:55:58,203 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:55:58" (1/1) ... [2023-11-24 23:55:58,239 INFO L138 Inliner]: procedures = 165, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 71 [2023-11-24 23:55:58,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:58,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:55:58,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:55:58,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:55:58,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:55:58,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:55:58,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:55:58,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:55:58,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (1/1) ... [2023-11-24 23:55:58,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:55:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:58,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/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:55:58,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/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:55:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-24 23:55:58,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-24 23:55:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:55:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:55:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:55:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:55:58,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:55:58,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:55:58,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:55:58,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:55:58,572 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:55:58,578 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:55:58,827 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:55:58,932 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:55:58,935 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 23:55:58,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:58 BoogieIcfgContainer [2023-11-24 23:55:58,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:55:58,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:55:58,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:55:58,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:55:58,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:55:57" (1/3) ... [2023-11-24 23:55:58,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe7289f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:58, skipping insertion in model container [2023-11-24 23:55:58,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:58" (2/3) ... [2023-11-24 23:55:58,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe7289f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:58, skipping insertion in model container [2023-11-24 23:55:58,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:58" (3/3) ... [2023-11-24 23:55:58,950 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2023-11-24 23:55:58,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:55:58,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-24 23:55:59,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:55:59,040 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;@e89cad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:55:59,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-24 23:55:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 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:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 23:55:59,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:59,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:59,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:55:59,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -661841724, now seen corresponding path program 1 times [2023-11-24 23:55:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843274354] [2023-11-24 23:55:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:59,484 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:55:59,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843274354] [2023-11-24 23:55:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843274354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:59,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:55:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260147944] [2023-11-24 23:55:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:59,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:55:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:55:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:55:59,528 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:55:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:59,666 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-11-24 23:55:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:55:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-24 23:55:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:59,679 INFO L225 Difference]: With dead ends: 55 [2023-11-24 23:55:59,679 INFO L226 Difference]: Without dead ends: 48 [2023-11-24 23:55:59,683 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:55:59,691 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:59,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-24 23:55:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2023-11-24 23:55:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 27 states have internal predecessors, (31), 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:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-24 23:55:59,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 8 [2023-11-24 23:55:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:59,745 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-24 23:55:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:55:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-24 23:55:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:55:59,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:59,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:59,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:55:59,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:55:59,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1268115052, now seen corresponding path program 1 times [2023-11-24 23:55:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826114506] [2023-11-24 23:55:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:00,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826114506] [2023-11-24 23:56:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826114506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177721869] [2023-11-24 23:56:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:00,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:00,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:00,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:00,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:56:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:00,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:56:00,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:00,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:56:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177721869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:56:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-24 23:56:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182498464] [2023-11-24 23:56:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:00,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:56:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:56:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:56:00,240 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:56:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:00,352 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-24 23:56:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:00,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-24 23:56:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:00,354 INFO L225 Difference]: With dead ends: 48 [2023-11-24 23:56:00,355 INFO L226 Difference]: Without dead ends: 47 [2023-11-24 23:56:00,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-24 23:56:00,357 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:00,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 101 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:56:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-24 23:56:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2023-11-24 23:56:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 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:56:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-24 23:56:00,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2023-11-24 23:56:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:00,365 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-24 23:56:00,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:56:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-24 23:56:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 23:56:00,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:00,367 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:00,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:00,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:00,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:00,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 656861005, now seen corresponding path program 1 times [2023-11-24 23:56:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112559525] [2023-11-24 23:56:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:00,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112559525] [2023-11-24 23:56:00,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112559525] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743235510] [2023-11-24 23:56:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:00,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:00,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:00,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:00,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:56:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:00,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:56:00,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:00,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:00,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743235510] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:00,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [164401831] [2023-11-24 23:56:00,995 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-24 23:56:00,995 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:00,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:01,005 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:01,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:02,318 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 38 for LOIs [2023-11-24 23:56:02,359 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [164401831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2023-11-24 23:56:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907364315] [2023-11-24 23:56:03,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:03,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 23:56:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:03,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 23:56:03,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-11-24 23:56:03,376 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:56:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:04,934 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-24 23:56:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 23:56:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-24 23:56:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:04,937 INFO L225 Difference]: With dead ends: 37 [2023-11-24 23:56:04,937 INFO L226 Difference]: Without dead ends: 36 [2023-11-24 23:56:04,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=88, Invalid=463, Unknown=1, NotChecked=0, Total=552 [2023-11-24 23:56:04,940 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:04,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:56:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-24 23:56:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-11-24 23:56:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-11-24 23:56:04,960 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2023-11-24 23:56:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:04,964 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-24 23:56:04,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:56:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-11-24 23:56:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 23:56:04,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:04,966 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:04,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:05,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:05,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:05,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1162066149, now seen corresponding path program 1 times [2023-11-24 23:56:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185959148] [2023-11-24 23:56:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:05,283 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:56:05,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185959148] [2023-11-24 23:56:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185959148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:56:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585328818] [2023-11-24 23:56:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:05,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:56:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:05,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:56:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:56:05,287 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:05,325 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-11-24 23:56:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:56:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-11-24 23:56:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:05,327 INFO L225 Difference]: With dead ends: 50 [2023-11-24 23:56:05,327 INFO L226 Difference]: Without dead ends: 31 [2023-11-24 23:56:05,328 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:56:05,329 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:05,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:56:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-24 23:56:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-24 23:56:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-11-24 23:56:05,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 14 [2023-11-24 23:56:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:05,343 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-11-24 23:56:05,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-11-24 23:56:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:56:05,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:05,345 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:56:05,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:56:05,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:05,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -598853949, now seen corresponding path program 1 times [2023-11-24 23:56:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77252271] [2023-11-24 23:56:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:05,418 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:56:05,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77252271] [2023-11-24 23:56:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77252271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:05,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:56:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2264100] [2023-11-24 23:56:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:56:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:56:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:56:05,421 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:56:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:05,487 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-11-24 23:56:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:56:05,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-24 23:56:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:05,489 INFO L225 Difference]: With dead ends: 46 [2023-11-24 23:56:05,489 INFO L226 Difference]: Without dead ends: 42 [2023-11-24 23:56:05,490 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:56:05,491 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:05,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:56:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-24 23:56:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-11-24 23:56:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:56:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-24 23:56:05,507 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 17 [2023-11-24 23:56:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:05,507 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-24 23:56:05,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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:56:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-11-24 23:56:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 23:56:05,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:05,509 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:56:05,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:56:05,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:05,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash 788489319, now seen corresponding path program 1 times [2023-11-24 23:56:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190411333] [2023-11-24 23:56:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:05,577 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:56:05,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190411333] [2023-11-24 23:56:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190411333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:05,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:56:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974767001] [2023-11-24 23:56:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:05,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:56:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:56:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:56:05,581 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:05,644 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-24 23:56:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:56:05,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:05,645 INFO L225 Difference]: With dead ends: 43 [2023-11-24 23:56:05,646 INFO L226 Difference]: Without dead ends: 35 [2023-11-24 23:56:05,646 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:56:05,647 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:05,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:56:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-24 23:56:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-24 23:56:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:56:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-11-24 23:56:05,663 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2023-11-24 23:56:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:05,663 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-24 23:56:05,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-11-24 23:56:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 23:56:05,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:05,665 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:05,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:56:05,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:05,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1816437317, now seen corresponding path program 1 times [2023-11-24 23:56:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024381202] [2023-11-24 23:56:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-24 23:56:05,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024381202] [2023-11-24 23:56:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024381202] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320981080] [2023-11-24 23:56:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:05,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:05,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:56:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:05,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:56:05,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 23:56:05,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-24 23:56:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320981080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1196564684] [2023-11-24 23:56:06,054 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-24 23:56:06,054 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:06,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:06,055 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:06,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:08,214 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:08,240 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1196564684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 6, 6] total 24 [2023-11-24 23:56:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753846043] [2023-11-24 23:56:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:09,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-24 23:56:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-24 23:56:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2023-11-24 23:56:09,820 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:11,467 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-11-24 23:56:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 23:56:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-24 23:56:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:11,470 INFO L225 Difference]: With dead ends: 42 [2023-11-24 23:56:11,470 INFO L226 Difference]: Without dead ends: 39 [2023-11-24 23:56:11,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=154, Invalid=775, Unknown=1, NotChecked=0, Total=930 [2023-11-24 23:56:11,472 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:11,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:56:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-24 23:56:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-11-24 23:56:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:56:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-11-24 23:56:11,494 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2023-11-24 23:56:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:11,495 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-11-24 23:56:11,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-11-24 23:56:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 23:56:11,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:11,497 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:11,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:11,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:11,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:11,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 474982061, now seen corresponding path program 1 times [2023-11-24 23:56:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086942026] [2023-11-24 23:56:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-24 23:56:11,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086942026] [2023-11-24 23:56:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086942026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860282829] [2023-11-24 23:56:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:11,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:11,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:11,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:56:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:11,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:56:11,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-24 23:56:12,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-24 23:56:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860282829] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2102234601] [2023-11-24 23:56:12,078 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-24 23:56:12,078 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:12,079 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:12,079 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:12,079 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:13,805 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:13,830 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:15,271 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1221#(and (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_alloc_17_#t~post42#1|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_alloc_17_~len#1| 10) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_alloc_17_#in~len#1| 10))' at error location [2023-11-24 23:56:15,271 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:56:15,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-24 23:56:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727906961] [2023-11-24 23:56:15,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:15,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-24 23:56:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-24 23:56:15,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2023-11-24 23:56:15,274 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:56:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:15,416 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-11-24 23:56:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:56:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-11-24 23:56:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:15,418 INFO L225 Difference]: With dead ends: 60 [2023-11-24 23:56:15,418 INFO L226 Difference]: Without dead ends: 38 [2023-11-24 23:56:15,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2023-11-24 23:56:15,420 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:15,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 83 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:56:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-24 23:56:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-24 23:56:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:56:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-11-24 23:56:15,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2023-11-24 23:56:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:15,437 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-11-24 23:56:15,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:56:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-11-24 23:56:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-24 23:56:15,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:15,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:15,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:15,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:15,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:15,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash -442817107, now seen corresponding path program 2 times [2023-11-24 23:56:15,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:15,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240179570] [2023-11-24 23:56:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 23:56:15,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240179570] [2023-11-24 23:56:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240179570] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287861996] [2023-11-24 23:56:15,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 23:56:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:15,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:15,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:56:15,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-24 23:56:15,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:56:15,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:56:15,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 23:56:15,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 23:56:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287861996] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2020226749] [2023-11-24 23:56:16,004 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-24 23:56:16,004 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:16,004 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:16,005 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:16,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:17,307 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:17,325 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:18,702 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1565#(and (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_alloc_17_#t~post42#1|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_alloc_17_~len#1| 10) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_alloc_17_#in~len#1| 10))' at error location [2023-11-24 23:56:18,702 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:56:18,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-24 23:56:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724070255] [2023-11-24 23:56:18,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:18,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 23:56:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 23:56:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-11-24 23:56:18,705 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:18,907 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-24 23:56:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 23:56:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-11-24 23:56:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:18,909 INFO L225 Difference]: With dead ends: 78 [2023-11-24 23:56:18,909 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 23:56:18,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2023-11-24 23:56:18,911 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:18,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 121 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:56:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 23:56:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2023-11-24 23:56:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2023-11-24 23:56:18,936 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2023-11-24 23:56:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:18,937 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2023-11-24 23:56:18,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2023-11-24 23:56:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:56:18,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:18,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:18,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 23:56:19,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:19,144 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:19,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -393219931, now seen corresponding path program 1 times [2023-11-24 23:56:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:19,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007791399] [2023-11-24 23:56:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-24 23:56:19,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007791399] [2023-11-24 23:56:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007791399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:56:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357963858] [2023-11-24 23:56:19,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:56:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:56:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:56:19,246 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 23:56:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:19,286 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-11-24 23:56:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:56:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-11-24 23:56:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:19,288 INFO L225 Difference]: With dead ends: 56 [2023-11-24 23:56:19,289 INFO L226 Difference]: Without dead ends: 55 [2023-11-24 23:56:19,289 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:56:19,290 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:19,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:56:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-24 23:56:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-24 23:56:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2023-11-24 23:56:19,319 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 34 [2023-11-24 23:56:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:19,319 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2023-11-24 23:56:19,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 23:56:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2023-11-24 23:56:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-24 23:56:19,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:19,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:19,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:56:19,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:19,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 695084132, now seen corresponding path program 1 times [2023-11-24 23:56:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706194069] [2023-11-24 23:56:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 23:56:19,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706194069] [2023-11-24 23:56:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706194069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82570961] [2023-11-24 23:56:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:19,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:19,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:56:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:19,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 23:56:19,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:56:19,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 23:56:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82570961] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723677356] [2023-11-24 23:56:19,983 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-24 23:56:19,983 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:19,984 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:19,984 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:19,984 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:21,450 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:21,474 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1723677356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10, 10, 10] total 39 [2023-11-24 23:56:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814175425] [2023-11-24 23:56:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:23,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 23:56:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 23:56:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2023-11-24 23:56:23,266 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:24,973 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-11-24 23:56:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 23:56:24,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-11-24 23:56:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:24,975 INFO L225 Difference]: With dead ends: 59 [2023-11-24 23:56:24,975 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 23:56:24,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=301, Invalid=1860, Unknown=1, NotChecked=0, Total=2162 [2023-11-24 23:56:24,977 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:24,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:56:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 23:56:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-24 23:56:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-11-24 23:56:25,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 35 [2023-11-24 23:56:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:25,005 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-11-24 23:56:25,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-11-24 23:56:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-24 23:56:25,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:25,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:25,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-24 23:56:25,212 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:25,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1214163897, now seen corresponding path program 1 times [2023-11-24 23:56:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508913301] [2023-11-24 23:56:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-24 23:56:25,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508913301] [2023-11-24 23:56:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508913301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675553673] [2023-11-24 23:56:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:25,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:25,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:25,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:25,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 23:56:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:25,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 23:56:25,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 23:56:25,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-24 23:56:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675553673] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:25,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591143395] [2023-11-24 23:56:25,791 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-24 23:56:25,791 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:25,791 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:25,791 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:25,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:27,359 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:27,380 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1591143395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:29,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10, 10, 10] total 40 [2023-11-24 23:56:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159211311] [2023-11-24 23:56:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:29,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 23:56:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 23:56:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2023-11-24 23:56:29,361 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:31,222 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-11-24 23:56:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-24 23:56:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-11-24 23:56:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:31,224 INFO L225 Difference]: With dead ends: 58 [2023-11-24 23:56:31,224 INFO L226 Difference]: Without dead ends: 49 [2023-11-24 23:56:31,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=328, Invalid=2121, Unknown=1, NotChecked=0, Total=2450 [2023-11-24 23:56:31,226 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:31,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:56:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-24 23:56:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-24 23:56:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:56:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-24 23:56:31,249 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 38 [2023-11-24 23:56:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:31,249 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-24 23:56:31,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 23:56:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-24 23:56:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-24 23:56:31,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:31,251 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:31,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 23:56:31,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-24 23:56:31,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1938718745, now seen corresponding path program 3 times [2023-11-24 23:56:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:31,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45761036] [2023-11-24 23:56:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-24 23:56:31,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45761036] [2023-11-24 23:56:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45761036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191736407] [2023-11-24 23:56:31,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 23:56:31,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:31,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:31,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:31,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 23:56:32,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 23:56:32,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:56:32,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 23:56:32,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-24 23:56:32,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-24 23:56:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191736407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39364584] [2023-11-24 23:56:32,520 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-24 23:56:32,521 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:56:32,521 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:56:32,521 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:56:32,521 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:56:33,808 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:56:33,832 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:56:35,544 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3095#(and (<= 1 |#StackHeapBarrier|) (<= 2147483647 |ULTIMATE.start_alloc_17_#t~post42#1|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_alloc_17_~len#1| 10) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_alloc_17_#in~len#1| 10))' at error location [2023-11-24 23:56:35,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:56:35,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:35,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2023-11-24 23:56:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17472611] [2023-11-24 23:56:35,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:35,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 23:56:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:35,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 23:56:35,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2023-11-24 23:56:35,547 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-24 23:56:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:35,909 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-11-24 23:56:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 23:56:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 56 [2023-11-24 23:56:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:35,910 INFO L225 Difference]: With dead ends: 86 [2023-11-24 23:56:35,910 INFO L226 Difference]: Without dead ends: 0 [2023-11-24 23:56:35,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2023-11-24 23:56:35,912 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:35,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 52 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:56:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-24 23:56:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-24 23:56:35,913 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:56:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-24 23:56:35,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2023-11-24 23:56:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:35,914 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-24 23:56:35,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-24 23:56:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-24 23:56:35,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-24 23:56:35,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-24 23:56:35,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-24 23:56:35,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-24 23:56:35,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-24 23:56:35,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-24 23:56:35,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-24 23:56:35,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-24 23:56:35,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-24 23:56:35,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:36,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:36,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-24 23:56:41,229 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:56:41,229 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-11-24 23:56:41,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point alloc_17_err#1(lines 760 776) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point L771(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point L771-4(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point L771-5(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L895 garLoopResultBuilder]: At program point L771-6(lines 771 774) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse3 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1))) (or (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse0 .cse1 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse2 (<= .cse3 0) .cse4) (and (<= |ULTIMATE.start_alloc_17_~i~0#1| 9) .cse0 (<= 0 .cse3) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse1 (or (and (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (< 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) .cse2 (= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~j~0#1| 8) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) .cse4 (= |ULTIMATE.start_alloc_17_#in~len#1| 10)))) [2023-11-24 23:56:41,231 INFO L895 garLoopResultBuilder]: At program point L780(line 780) 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:56:41,231 INFO L899 garLoopResultBuilder]: For program point L780-1(line 780) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L899 garLoopResultBuilder]: For program point L764-3(line 764) no Hoare annotation was computed. [2023-11-24 23:56:41,231 INFO L899 garLoopResultBuilder]: For program point L764-4(line 764) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L895 garLoopResultBuilder]: At program point L764-5(lines 764 768) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.offset| 0) (or (and (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (< 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483646) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (let ((.cse0 (= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse1 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse2 (= |ULTIMATE.start_alloc_17_#in~len#1| 10))) (or (and (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse0 .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse1 .cse2))) (= |~#ldv_global_msg_list~0.base| 1)) [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 787) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point alloc_17_returnLabel#1(lines 760 776) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point L777(lines 777 788) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L895 garLoopResultBuilder]: At program point L765(line 765) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse4 (= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse5 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse6 (= |~#ldv_global_msg_list~0.base| 1)) (.cse7 (= |ULTIMATE.start_alloc_17_#in~len#1| 10))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse3 .cse4 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse5 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) .cse6 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse7) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_alloc_17_~i~0#1| 1) |ULTIMATE.start_alloc_17_~len#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse5 .cse6 .cse7))) [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point L765-1(line 765) no Hoare annotation was computed. [2023-11-24 23:56:41,232 INFO L899 garLoopResultBuilder]: For program point L782-3(line 782) no Hoare annotation was computed. [2023-11-24 23:56:41,233 INFO L899 garLoopResultBuilder]: For program point L782-4(line 782) no Hoare annotation was computed. [2023-11-24 23:56:41,234 INFO L895 garLoopResultBuilder]: At program point L782-5(lines 782 784) the Hoare annotation is: (let ((.cse22 (select |#memory_$Pointer$.base| 1)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse13 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse15 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse25 (select |#memory_$Pointer$.offset| 1))) (let ((.cse9 (= |ULTIMATE.start_entry_point_~i~1#1| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse0 (= (select |#length| 1) 8)) (.cse2 (= (select .cse25 0) 0)) (.cse4 (= (select .cse25 4) 0)) (.cse6 (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_14| Int) (|v_ldv_malloc_#t~malloc12.offset_14| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_21| (Array Int Int)) (|v_#valid_29| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse23 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |#length| |v_#length_21|) .cse16 .cse15 (= |v_#valid_29| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_14|) .cse23 (= |v_ldv_malloc_#t~malloc12.offset_14| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|)) (and .cse13 (not .cse23) .cse15 (= (store |v_#length_21| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= |#valid| (store |v_#valid_29| |ULTIMATE.start_entry_point_~array~0#1.base| 1)) (= (select |v_#valid_29| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (and (exists ((|v_#length_BEFORE_CALL_2| (Array Int Int))) (= (select |v_#length_BEFORE_CALL_2| 1) 8)) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_14| Int) (|v_ldv_malloc_#t~malloc12.offset_14| Int) (|v_#length_21| (Array Int Int)) (|v_#valid_29| (Array Int Int))) (and (let ((.cse24 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |#length| |v_#length_21|) .cse16 .cse15 (= |v_#valid_29| |#valid|) .cse24 (= |v_ldv_malloc_#t~malloc12.offset_14| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_14|)) (and .cse13 (not .cse24) .cse15 (= (store |v_#length_21| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= |#valid| (store |v_#valid_29| |ULTIMATE.start_entry_point_~array~0#1.base| 1)) (= (select |v_#valid_29| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))))) (.cse7 (= (select .cse22 0) 1)) (.cse8 (= (select |#valid| 1) 1)) (.cse11 (= (select |#valid| 0) 0)) (.cse12 (= (select .cse22 4) 1)) (.cse3 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse5 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse10 (= |~#ldv_global_msg_list~0.base| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43| Int) (|v_#length_90| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (|v_ldv_malloc_#t~malloc12.offset_69| Int) (|v_#valid_102| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse14 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse13 (not .cse14) .cse15 (= (store |v_#valid_102| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_90| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (select |v_#valid_102| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse16 (= |v_ldv_malloc_#t~malloc12.offset_69| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43|) .cse15 (= |v_ldv_malloc_#t~malloc12.base_69| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43|) (= |#length| |v_#length_90|) .cse14 (= |v_#valid_102| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_#length_90| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44| Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (|v_ldv_malloc_#t~malloc12.offset_69| Int) (|v_#valid_102| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse17 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse13 (not .cse17) .cse15 (= (store |v_#valid_102| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= |#length| (store |v_#length_90| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (select |v_#valid_102| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse16 .cse15 (= |#length| |v_#length_90|) (= |v_ldv_malloc_#t~malloc12.base_69| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44|) .cse17 (= |v_ldv_malloc_#t~malloc12.offset_69| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44|) (= |v_#valid_102| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (or (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_43| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_#length_35| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4| Int)) (and (let ((.cse18 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse13 (not .cse18) .cse15 (= (store |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_35| |ULTIMATE.start_entry_point_~array~0#1.base| 40))) (and (= |#length| |v_#length_35|) .cse16 .cse15 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4| |v_ldv_malloc_#t~malloc12.base_25|) (= |v_#valid_43| |#valid|) .cse18 (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_43| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#length_35| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse19 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3|) (= |#length| |v_#length_35|) (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3| |v_ldv_malloc_#t~malloc12.base_25|) .cse16 .cse15 (= |v_#valid_43| |#valid|) .cse19) (and .cse13 (not .cse19) .cse15 (= (store |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_43| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_35| |ULTIMATE.start_entry_point_~array~0#1.base| 40))))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33| Int) (|v_ldv_malloc_#t~malloc12.base_58| Int) (|v_ldv_malloc_#t~malloc12.offset_58| Int) (|v_#valid_85| (Array Int Int)) (|v_#length_76| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse20 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse13 (not .cse20) (= (store |v_#length_76| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) .cse15 (= |#valid| (store |v_#valid_85| |ULTIMATE.start_entry_point_~array~0#1.base| 1)) (= (select |v_#valid_85| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_76|) .cse16 .cse15 (= |v_ldv_malloc_#t~malloc12.offset_58| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33|) (= |v_ldv_malloc_#t~malloc12.base_58| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33|) .cse20 (= |v_#valid_85| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_34| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34| Int) (|v_ldv_malloc_#t~malloc12.base_58| Int) (|v_ldv_malloc_#t~malloc12.offset_58| Int) (|v_#valid_85| (Array Int Int)) (|v_#length_76| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse21 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse13 (not .cse21) (= (store |v_#length_76| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) .cse15 (= |#valid| (store |v_#valid_85| |ULTIMATE.start_entry_point_~array~0#1.base| 1)) (= (select |v_#valid_85| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_76|) .cse16 .cse15 (= |v_ldv_malloc_#t~malloc12.offset_58| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_34|) (= |v_ldv_malloc_#t~malloc12.base_58| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34|) .cse21 (= |v_#valid_85| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse12) (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse1 (or (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse11 .cse12) (< 0 |ULTIMATE.start_entry_point_~i~1#1|)) .cse3 .cse5 .cse10)))) [2023-11-24 23:56:41,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2023-11-24 23:56:41,238 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:41,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 23:56:41,257 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,258 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-24 23:56:41,294 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-24 23:56:41,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-24 23:56:41,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-24 23:56:41,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated [2023-11-24 23:56:41,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-24 23:56:41,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-24 23:56:41,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-24 23:56:41,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-24 23:56:41,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-24 23:56:41,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-24 23:56:41,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43 : int, v_#length_90 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_69 : int, v_ldv_malloc_#t~malloc12.offset_69 : int, v_#valid_102 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43 : 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_102[~array~0!base := 1] == #valid) && #length == v_#length_90[~array~0!base := 40]) && v_#valid_102[~array~0!base] == 0) || ((((((~array~0!base == 0 && v_ldv_malloc_#t~malloc12.offset_69 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_69 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43) && #length == v_#length_90) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_102 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_90 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44 : int, v_ldv_malloc_#t~malloc12.base_69 : int, v_ldv_malloc_#t~malloc12.offset_69 : int, v_#valid_102 : [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_102[~array~0!base := 1] == #valid) && #length == v_#length_90[~array~0!base := 40]) && v_#valid_102[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_90) && v_ldv_malloc_#t~malloc12.base_69 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_69 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44) && v_#valid_102 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_25 : int, v_#length_35 : [int]int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 : int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && #length == v_#length_35[~array~0!base := 40]) || ((((((#length == v_#length_35 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 == v_ldv_malloc_#t~malloc12.base_25) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_35 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 && #length == v_#length_35) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 == v_ldv_malloc_#t~malloc12.base_25) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && #length == v_#length_35[~array~0!base := 40]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-24 23:56:41,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated [2023-11-24 23:56:41,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-24 23:56:41,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-24 23:56:41,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-24 23:56:41,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33 : int, v_ldv_malloc_#t~malloc12.base_58 : int, v_ldv_malloc_#t~malloc12.offset_58 : int, v_#valid_85 : [int]int, v_#length_76 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#length_76[~array~0!base := 40] == #length) && ~array~0!offset == 0) && #valid == v_#valid_85[~array~0!base := 1]) && v_#valid_85[~array~0!base] == 0) || ((((((#length == v_#length_76 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_58 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33) && v_ldv_malloc_#t~malloc12.base_58 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_85 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_34 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34 : int, v_ldv_malloc_#t~malloc12.base_58 : int, v_ldv_malloc_#t~malloc12.offset_58 : int, v_#valid_85 : [int]int, v_#length_76 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#length_76[~array~0!base := 40] == #length) && ~array~0!offset == 0) && #valid == v_#valid_85[~array~0!base := 1]) && v_#valid_85[~array~0!base] == 0) || ((((((#length == v_#length_76 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_58 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_34) && v_ldv_malloc_#t~malloc12.base_58 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_85 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-24 23:56:41,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-24 23:56:41,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-24 23:56:41,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-24 23:56:41,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated [2023-11-24 23:56:41,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:56:41,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-24 23:56:41,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-24 23:56:41,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-24 23:56:41,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-24 23:56:41,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 11:56:41 BoogieIcfgContainer [2023-11-24 23:56:41,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 23:56:41,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 23:56:41,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 23:56:41,305 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 23:56:41,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:58" (3/4) ... [2023-11-24 23:56:41,308 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 23:56:41,312 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-24 23:56:41,318 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-24 23:56:41,319 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-24 23:56:41,319 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-24 23:56:41,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= i) && (i == 0)) && (10 == len)) && ((j + 1) <= 0)) || ((((((((i <= 9) && (0 <= (j + 1))) && (0 <= i)) && (10 == len)) && (len == 10)) && (j <= 8)) && (10 <= i)) && (\old(len) == 10))) [2023-11-24 23:56:41,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((i <= 2147483646) && (10 == len)) && (((((i == 0) && (len == 10)) && (10 <= i)) && (\old(len) == 10)) || ((((len == 10) && (1 <= i)) && (10 <= i)) && (\old(len) == 10)))) [2023-11-24 23:56:41,369 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= i) && (i == 0)) && (10 == len)) && ((j + 1) <= 0)) || ((((((((i <= 9) && (0 <= (j + 1))) && (0 <= i)) && (10 == len)) && (len == 10)) && (j <= 8)) && (10 <= i)) && (\old(len) == 10))) [2023-11-24 23:56:41,370 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((i <= 2147483646) && (10 == len)) && (((((i == 0) && (len == 10)) && (10 <= i)) && (\old(len) == 10)) || ((((len == 10) && (1 <= i)) && (10 <= i)) && (\old(len) == 10)))) [2023-11-24 23:56:41,427 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-24 23:56:41,427 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/bin/utaipan-verify-SwPr7d2a91/witness.yml [2023-11-24 23:56:41,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 23:56:41,428 INFO L158 Benchmark]: Toolchain (without parser) took 44043.15ms. Allocated memory was 127.9MB in the beginning and 545.3MB in the end (delta: 417.3MB). Free memory was 78.8MB in the beginning and 228.2MB in the end (delta: -149.4MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,428 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:56:41,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.85ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 78.4MB in the beginning and 125.0MB in the end (delta: -46.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.59ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,429 INFO L158 Benchmark]: Boogie Preprocessor took 38.74ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,429 INFO L158 Benchmark]: RCFGBuilder took 659.00ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 104.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,430 INFO L158 Benchmark]: TraceAbstraction took 42361.04ms. Allocated memory was 163.6MB in the beginning and 545.3MB in the end (delta: 381.7MB). Free memory was 104.0MB in the beginning and 233.5MB in the end (delta: -129.5MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,430 INFO L158 Benchmark]: Witness Printer took 122.22ms. Allocated memory is still 545.3MB. Free memory was 233.5MB in the beginning and 228.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 23:56:41,432 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.33ms. Allocated memory is still 127.9MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.85ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 78.4MB in the beginning and 125.0MB in the end (delta: -46.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.59ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.74ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.00ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 104.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42361.04ms. Allocated memory was 163.6MB in the beginning and 545.3MB in the end (delta: 381.7MB). Free memory was 104.0MB in the beginning and 233.5MB in the end (delta: -129.5MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. * Witness Printer took 122.22ms. Allocated memory is still 545.3MB. Free memory was 233.5MB in the beginning and 228.2MB in the end (delta: 5.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: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~array!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - 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: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 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: 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: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated - 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: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43 : int, v_#length_90 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_69 : int, v_ldv_malloc_#t~malloc12.offset_69 : int, v_#valid_102 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43 : 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_102[~array~0!base := 1] == #valid) && #length == v_#length_90[~array~0!base := 40]) && v_#valid_102[~array~0!base] == 0) || ((((((~array~0!base == 0 && v_ldv_malloc_#t~malloc12.offset_69 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_43) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_69 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_43) && #length == v_#length_90) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_102 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_90 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44 : int, v_ldv_malloc_#t~malloc12.base_69 : int, v_ldv_malloc_#t~malloc12.offset_69 : int, v_#valid_102 : [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_102[~array~0!base := 1] == #valid) && #length == v_#length_90[~array~0!base := 40]) && v_#valid_102[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_90) && v_ldv_malloc_#t~malloc12.base_69 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_44) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_69 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_44) && v_#valid_102 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_25 : int, v_#length_35 : [int]int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 : int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && #length == v_#length_35[~array~0!base := 40]) || ((((((#length == v_#length_35 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_4 == v_ldv_malloc_#t~malloc12.base_25) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_4)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_43 : [int]int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_35 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_3 && #length == v_#length_35) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_3 == v_ldv_malloc_#t~malloc12.base_25) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_43 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_43[~array~0!base := 1] == #valid) && v_#valid_43[~array~0!base] == 0) && #length == v_#length_35[~array~0!base := 40]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 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: 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: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33 : int, v_ldv_malloc_#t~malloc12.base_58 : int, v_ldv_malloc_#t~malloc12.offset_58 : int, v_#valid_85 : [int]int, v_#length_76 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#length_76[~array~0!base := 40] == #length) && ~array~0!offset == 0) && #valid == v_#valid_85[~array~0!base := 1]) && v_#valid_85[~array~0!base] == 0) || ((((((#length == v_#length_76 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_58 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_33) && v_ldv_malloc_#t~malloc12.base_58 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_33) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_85 == #valid))) && 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_34 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34 : int, v_ldv_malloc_#t~malloc12.base_58 : int, v_ldv_malloc_#t~malloc12.offset_58 : int, v_#valid_85 : [int]int, v_#length_76 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#length_76[~array~0!base := 40] == #length) && ~array~0!offset == 0) && #valid == v_#valid_85[~array~0!base := 1]) && v_#valid_85[~array~0!base] == 0) || ((((((#length == v_#length_76 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_58 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_34) && v_ldv_malloc_#t~malloc12.base_58 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_34) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_85 == #valid))) && 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: 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: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_14) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_BEFORE_CALL_2 : [int]int :: v_#length_BEFORE_CALL_2[1] == 8) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_14 : int, v_ldv_malloc_#t~malloc12.offset_14 : int, v_#length_21 : [int]int, v_#valid_29 : [int]int :: ((((((((#length == v_#length_21 && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_29 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_14 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_14) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#length_21[~array~0!base := 40] == #length) && #valid == v_#valid_29[~array~0!base := 1]) && v_#valid_29[~array~0!base] == 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: 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: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: 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, 31 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 815 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 600 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1139 IncrementalHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 215 mSDtfsCounter, 1139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 520 SyntacticMatches, 19 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3420 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=11, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 77 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 19 PreInvPairs, 36 NumberOfFragments, 1337 HoareAnnotationTreeSize, 19 FomulaSimplifications, 6538 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2859 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 563 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 1635 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1438 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 478/637 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: 6.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 84, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 131, TOOLS_POST_TIME: 3.4s, TOOLS_POST_CALL_APPLICATIONS: 39, TOOLS_POST_CALL_TIME: 0.7s, TOOLS_POST_RETURN_APPLICATIONS: 32, TOOLS_POST_RETURN_TIME: 1.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 202, TOOLS_QUANTIFIERELIM_TIME: 5.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 296, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 51, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 9, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 17, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 84, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 3.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 17, CALL_SUMMARIZER_APPLICATIONS: 32, 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: 1375, DAG_COMPRESSION_RETAINED_NODES: 243, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 771]: Loop Invariant Derived loop invariant: (((((0 <= i) && (i == 0)) && (10 == len)) && ((j + 1) <= 0)) || ((((((((i <= 9) && (0 <= (j + 1))) && (0 <= i)) && (10 == len)) && (len == 10)) && (j <= 8)) && (10 <= i)) && (\old(len) == 10))) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((i <= 2147483646) && (10 == len)) && (((((i == 0) && (len == 10)) && (10 <= i)) && (\old(len) == 10)) || ((((len == 10) && (1 <= i)) && (10 <= i)) && (\old(len) == 10)))) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: ((((10 == len) && (i == 0)) || ((10 == len) && (i == 0))) || ((0 <= i) && (10 == len))) RESULT: Ultimate proved your program to be correct! [2023-11-24 23:56:41,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b0819a1-6e15-4a93-b49d-32513ad61e10/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