./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:06:42,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:06:42,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:06:42,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:06:42,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:06:42,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:06:42,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:06:42,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:06:42,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:06:42,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:06:42,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:06:42,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:06:42,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:06:42,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:06:42,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:06:42,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:06:42,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:06:42,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:06:42,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:06:42,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:06:42,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:06:42,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:06:42,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:06:42,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:06:42,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:06:42,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:06:42,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:06:42,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:06:42,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:06:42,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:42,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:06:42,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:06:42,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:06:42,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:06:42,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:06:42,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:06:42,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:06:42,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:06:42,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:06:42,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2024-11-17 04:06:42,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:06:42,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:06:42,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:06:42,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:06:42,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:06:42,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2024-11-17 04:06:44,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:06:44,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:06:44,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2024-11-17 04:06:44,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c56f2a14c/7dab2207969d4308998c21d62cd5ac99/FLAGa4615c8b0 [2024-11-17 04:06:44,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c56f2a14c/7dab2207969d4308998c21d62cd5ac99 [2024-11-17 04:06:44,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:06:44,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:06:44,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:44,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:06:44,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:06:44,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b50f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44, skipping insertion in model container [2024-11-17 04:06:44,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:06:44,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:44,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:06:44,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:44,880 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:06:44,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44 WrapperNode [2024-11-17 04:06:44,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:44,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:44,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:06:44,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:06:44,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,933 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 128 [2024-11-17 04:06:44,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:44,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:06:44,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:06:44,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:06:44,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,969 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-17 04:06:44,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:06:44,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:06:44,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:06:44,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:06:44,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (1/1) ... [2024-11-17 04:06:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:44,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:45,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 04:06:45,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 04:06:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:06:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:06:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-17 04:06:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-17 04:06:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-17 04:06:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-17 04:06:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-17 04:06:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 04:06:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:06:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:06:45,192 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:06:45,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:06:45,300 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc ldv_kref_put_#t~ret34#1; [2024-11-17 04:06:45,307 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-17 04:06:45,384 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-17 04:06:45,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:06:45,400 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:06:45,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:06:45,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:45 BoogieIcfgContainer [2024-11-17 04:06:45,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:06:45,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:06:45,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:06:45,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:06:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:06:44" (1/3) ... [2024-11-17 04:06:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d07bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:45, skipping insertion in model container [2024-11-17 04:06:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:44" (2/3) ... [2024-11-17 04:06:45,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d07bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:45, skipping insertion in model container [2024-11-17 04:06:45,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:45" (3/3) ... [2024-11-17 04:06:45,415 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2024-11-17 04:06:45,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:06:45,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 04:06:45,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:06:45,488 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@7f621ad4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:06:45,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 04:06:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:06:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:06:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:45,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:45,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 480239907, now seen corresponding path program 1 times [2024-11-17 04:06:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:45,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920767993] [2024-11-17 04:06:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920767993] [2024-11-17 04:06:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920767993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:45,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:06:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265575347] [2024-11-17 04:06:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:45,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:45,928 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 04:06:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:46,053 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-11-17 04:06:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 [2024-11-17 04:06:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:46,063 INFO L225 Difference]: With dead ends: 110 [2024-11-17 04:06:46,064 INFO L226 Difference]: Without dead ends: 70 [2024-11-17 04:06:46,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:46,069 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:46,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 202 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-17 04:06:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2024-11-17 04:06:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-17 04:06:46,108 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 12 [2024-11-17 04:06:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:46,108 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-17 04:06:46,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 04:06:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-17 04:06:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:06:46,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:46,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:46,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:06:46,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:46,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2071917054, now seen corresponding path program 1 times [2024-11-17 04:06:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:46,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680919967] [2024-11-17 04:06:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:46,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:46,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680919967] [2024-11-17 04:06:46,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680919967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:46,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:46,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:06:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325604350] [2024-11-17 04:06:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:46,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:06:46,284 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 04:06:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:46,442 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2024-11-17 04:06:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:06:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 [2024-11-17 04:06:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:46,443 INFO L225 Difference]: With dead ends: 94 [2024-11-17 04:06:46,443 INFO L226 Difference]: Without dead ends: 64 [2024-11-17 04:06:46,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:06:46,445 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:46,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-17 04:06:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-17 04:06:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-17 04:06:46,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 12 [2024-11-17 04:06:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-17 04:06:46,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 04:06:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-17 04:06:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:46,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:46,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:06:46,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1164698274, now seen corresponding path program 1 times [2024-11-17 04:06:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538062664] [2024-11-17 04:06:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538062664] [2024-11-17 04:06:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538062664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 04:06:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748376194] [2024-11-17 04:06:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:06:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:06:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:06:46,592 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-11-17 04:06:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:46,711 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2024-11-17 04:06:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:06:46,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-17 04:06:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:46,712 INFO L225 Difference]: With dead ends: 105 [2024-11-17 04:06:46,712 INFO L226 Difference]: Without dead ends: 71 [2024-11-17 04:06:46,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:46,714 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:46,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 225 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-17 04:06:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-11-17 04:06:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.28) internal successors, (64), 55 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-17 04:06:46,723 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 17 [2024-11-17 04:06:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-17 04:06:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-11-17 04:06:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-17 04:06:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 04:06:46,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:46,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:46,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:06:46,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1745467803, now seen corresponding path program 1 times [2024-11-17 04:06:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748387651] [2024-11-17 04:06:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:46,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748387651] [2024-11-17 04:06:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748387651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 04:06:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030145580] [2024-11-17 04:06:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:46,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:06:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:06:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:46,859 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:06:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:46,985 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2024-11-17 04:06:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:06:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-17 04:06:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:46,986 INFO L225 Difference]: With dead ends: 95 [2024-11-17 04:06:46,986 INFO L226 Difference]: Without dead ends: 64 [2024-11-17 04:06:46,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 04:06:46,988 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:46,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 281 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-17 04:06:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-17 04:06:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-17 04:06:46,993 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 18 [2024-11-17 04:06:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-17 04:06:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:06:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-17 04:06:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:46,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:46,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:46,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:06:46,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 871295267, now seen corresponding path program 1 times [2024-11-17 04:06:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121839808] [2024-11-17 04:06:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:47,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121839808] [2024-11-17 04:06:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121839808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:47,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:06:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002058599] [2024-11-17 04:06:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:47,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:47,111 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-17 04:06:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:47,193 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-17 04:06:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2024-11-17 04:06:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:47,194 INFO L225 Difference]: With dead ends: 104 [2024-11-17 04:06:47,195 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 04:06:47,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:06:47,196 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:47,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 04:06:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-17 04:06:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-17 04:06:47,206 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 17 [2024-11-17 04:06:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:47,206 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-17 04:06:47,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-17 04:06:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-17 04:06:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 04:06:47,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:47,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:47,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 04:06:47,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash -569892082, now seen corresponding path program 1 times [2024-11-17 04:06:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137078686] [2024-11-17 04:06:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137078686] [2024-11-17 04:06:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137078686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:47,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:47,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 04:06:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760648712] [2024-11-17 04:06:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:47,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:06:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:06:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:47,336 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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) [2024-11-17 04:06:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:47,520 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-11-17 04:06:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:06:47,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2024-11-17 04:06:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:47,521 INFO L225 Difference]: With dead ends: 90 [2024-11-17 04:06:47,521 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 04:06:47,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:06:47,522 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:47,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 203 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:06:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 04:06:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-17 04:06:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 45 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-17 04:06:47,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 18 [2024-11-17 04:06:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:47,529 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-17 04:06:47,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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) [2024-11-17 04:06:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-17 04:06:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 04:06:47,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:47,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:06:47,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:47,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1393438713, now seen corresponding path program 1 times [2024-11-17 04:06:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267701025] [2024-11-17 04:06:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 04:06:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267701025] [2024-11-17 04:06:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267701025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:06:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962011221] [2024-11-17 04:06:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:47,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:06:47,688 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:47,775 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-11-17 04:06:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-17 04:06:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:47,776 INFO L225 Difference]: With dead ends: 101 [2024-11-17 04:06:47,776 INFO L226 Difference]: Without dead ends: 59 [2024-11-17 04:06:47,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:47,777 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:47,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-17 04:06:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-11-17 04:06:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-17 04:06:47,788 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 23 [2024-11-17 04:06:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:47,789 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-17 04:06:47,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-17 04:06:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 04:06:47,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:47,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:47,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 04:06:47,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1785654198, now seen corresponding path program 1 times [2024-11-17 04:06:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432655471] [2024-11-17 04:06:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432655471] [2024-11-17 04:06:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432655471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138499601] [2024-11-17 04:06:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:47,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:47,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:47,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:06:47,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 04:06:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:48,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-17 04:06:48,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:48,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 04:06:48,214 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_8 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_8 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_8 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_8 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_8)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-17 04:06:48,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:48,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:48,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-17 04:06:48,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 04:06:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:06:48,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138499601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-17 04:06:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25239766] [2024-11-17 04:06:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 04:06:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 04:06:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-17 04:06:48,390 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-17 04:06:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:48,620 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-17 04:06:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 04:06:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) Word has length 24 [2024-11-17 04:06:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:48,622 INFO L225 Difference]: With dead ends: 55 [2024-11-17 04:06:48,622 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 04:06:48,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=178, Unknown=1, NotChecked=26, Total=240 [2024-11-17 04:06:48,623 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:48,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 275 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2024-11-17 04:06:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 04:06:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-17 04:06:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 45 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-17 04:06:48,627 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 24 [2024-11-17 04:06:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:48,627 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-17 04:06:48,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-17 04:06:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-17 04:06:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 04:06:48,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:48,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:48,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 04:06:48,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:48,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:48,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash 479294727, now seen corresponding path program 1 times [2024-11-17 04:06:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:48,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533122621] [2024-11-17 04:06:48,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533122621] [2024-11-17 04:06:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533122621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857183589] [2024-11-17 04:06:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:49,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:06:49,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 04:06:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:49,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-17 04:06:49,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:49,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 04:06:49,182 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_12 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_12 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_12 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_12)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_12 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-17 04:06:49,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:49,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:49,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-17 04:06:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 04:06:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:06:49,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857183589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:49,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:49,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-17 04:06:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197904764] [2024-11-17 04:06:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:49,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 04:06:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 04:06:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-17 04:06:49,264 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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) [2024-11-17 04:06:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:49,357 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-17 04:06:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 04:06:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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) Word has length 25 [2024-11-17 04:06:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:49,358 INFO L225 Difference]: With dead ends: 55 [2024-11-17 04:06:49,358 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 04:06:49,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=178, Unknown=1, NotChecked=26, Total=240 [2024-11-17 04:06:49,358 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:49,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 250 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2024-11-17 04:06:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 04:06:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-17 04:06:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-17 04:06:49,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2024-11-17 04:06:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:49,362 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-17 04:06:49,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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) [2024-11-17 04:06:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-17 04:06:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 04:06:49,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:49,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:49,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:06:49,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-17 04:06:49,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:49,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1287788061, now seen corresponding path program 1 times [2024-11-17 04:06:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383860549] [2024-11-17 04:06:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:06:49,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383860549] [2024-11-17 04:06:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383860549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 04:06:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767337672] [2024-11-17 04:06:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:49,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 04:06:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 04:06:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 04:06:49,701 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:49,837 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-11-17 04:06:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 04:06:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-17 04:06:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:49,837 INFO L225 Difference]: With dead ends: 80 [2024-11-17 04:06:49,838 INFO L226 Difference]: Without dead ends: 57 [2024-11-17 04:06:49,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 04:06:49,838 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:49,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 171 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-17 04:06:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-11-17 04:06:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:06:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-17 04:06:49,845 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 30 [2024-11-17 04:06:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:49,845 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-17 04:06:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-17 04:06:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 04:06:49,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:49,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 04:06:49,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:49,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 645689765, now seen corresponding path program 1 times [2024-11-17 04:06:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849640713] [2024-11-17 04:06:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849640713] [2024-11-17 04:06:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849640713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938247130] [2024-11-17 04:06:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:50,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:50,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:06:50,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 04:06:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-11-17 04:06:50,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:50,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:06:50,291 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_18 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_18 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_18 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_18)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_18 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-17 04:06:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:50,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-17 04:06:50,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-17 04:06:50,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 04:06:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:50,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938247130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:55,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:06:55,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-11-17 04:06:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243221699] [2024-11-17 04:06:55,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:55,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 04:06:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 04:06:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=968, Unknown=2, NotChecked=62, Total=1122 [2024-11-17 04:06:55,229 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:55,995 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2024-11-17 04:06:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 04:06:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2024-11-17 04:06:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:55,998 INFO L225 Difference]: With dead ends: 108 [2024-11-17 04:06:55,998 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 04:06:55,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=168, Invalid=1725, Unknown=3, NotChecked=84, Total=1980 [2024-11-17 04:06:55,999 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:55,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 265 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 648 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2024-11-17 04:06:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 04:06:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-11-17 04:06:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-17 04:06:56,011 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 35 [2024-11-17 04:06:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:56,011 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-17 04:06:56,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-17 04:06:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 04:06:56,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:56,012 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:56,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 04:06:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:56,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 23905167, now seen corresponding path program 1 times [2024-11-17 04:06:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697400201] [2024-11-17 04:06:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-17 04:06:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697400201] [2024-11-17 04:06:56,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697400201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116435592] [2024-11-17 04:06:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:56,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:56,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:06:56,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 04:06:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:56,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-11-17 04:06:56,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:56,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:06:56,808 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_25 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_25 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_25 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_25 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_25)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#1|))) is different from true [2024-11-17 04:06:56,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:56,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:56,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-17 04:06:56,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-17 04:06:57,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 04:06:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:57,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:07:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116435592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:07:01,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:07:01,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2024-11-17 04:07:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587316328] [2024-11-17 04:07:01,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:07:01,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 04:07:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:07:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 04:07:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1090, Unknown=2, NotChecked=66, Total=1260 [2024-11-17 04:07:01,698 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 21 states have internal predecessors, (62), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:07:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:07:02,366 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-17 04:07:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 04:07:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 21 states have internal predecessors, (62), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-17 04:07:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:07:02,367 INFO L225 Difference]: With dead ends: 113 [2024-11-17 04:07:02,367 INFO L226 Difference]: Without dead ends: 61 [2024-11-17 04:07:02,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=178, Invalid=1802, Unknown=4, NotChecked=86, Total=2070 [2024-11-17 04:07:02,368 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:07:02,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 334 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 732 Invalid, 0 Unknown, 66 Unchecked, 0.4s Time] [2024-11-17 04:07:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-17 04:07:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-17 04:07:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 04:07:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-11-17 04:07:02,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 37 [2024-11-17 04:07:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:07:02,371 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-17 04:07:02,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 21 states have internal predecessors, (62), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:07:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-17 04:07:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 04:07:02,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:07:02,372 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:07:02,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 04:07:02,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:07:02,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:07:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:07:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1810928305, now seen corresponding path program 1 times [2024-11-17 04:07:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:07:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167775837] [2024-11-17 04:07:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:07:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:07:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:07:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:07:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:07:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 04:07:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:07:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-17 04:07:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:07:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:07:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:07:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167775837] [2024-11-17 04:07:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167775837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:07:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441822002] [2024-11-17 04:07:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:07:02,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:07:02,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:07:02,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:07:02,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 04:07:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:07:02,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 210 conjuncts are in the unsatisfiable core [2024-11-17 04:07:02,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:07:03,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 04:07:03,133 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_32 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_32 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_32 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_32 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_32)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-17 04:07:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:07:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:07:03,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-17 04:07:03,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 04:07:03,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 04:07:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:07:03,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:07:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441822002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:07:08,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:07:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 32 [2024-11-17 04:07:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098045297] [2024-11-17 04:07:08,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:07:08,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-17 04:07:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:07:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 04:07:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1910, Unknown=2, NotChecked=88, Total=2162 [2024-11-17 04:07:08,480 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 26 states have internal predecessors, (84), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 04:07:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:07:09,196 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-17 04:07:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 04:07:09,196 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 26 states have internal predecessors, (84), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2024-11-17 04:07:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:07:09,196 INFO L225 Difference]: With dead ends: 104 [2024-11-17 04:07:09,196 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 04:07:09,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=280, Invalid=3027, Unknown=3, NotChecked=112, Total=3422 [2024-11-17 04:07:09,198 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 04:07:09,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 319 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 729 Invalid, 0 Unknown, 60 Unchecked, 0.4s Time] [2024-11-17 04:07:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 04:07:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 04:07:09,198 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) [2024-11-17 04:07:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 04:07:09,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-17 04:07:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:07:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 04:07:09,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 26 states have internal predecessors, (84), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 04:07:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 04:07:09,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 04:07:09,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 04:07:09,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 04:07:09,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 04:07:09,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 04:07:09,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 04:07:09,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-17 04:07:09,405 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:07:09,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 04:07:09,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:07:09,702 WARN L156 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-17 04:07:09,706 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 04:07:09,706 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 04:07:09,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:07:09,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-17 04:07:09,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:07:09,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-17 04:07:09,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-17 04:07:09,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-17 04:07:09,712 WARN L156 FloydHoareUtils]: Requires clause for LDV_INIT_LIST_HEAD contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) Eliminated clause: true [2024-11-17 04:07:09,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:07:09,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-17 04:07:09,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-17 04:07:09,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-17 04:07:09,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD [2024-11-17 04:07:09,722 WARN L156 FloydHoareUtils]: Requires clause for ldv_kobject_put contained old-variable. Original clause: (let ((.cse3 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (let ((.cse1 (= .cse3 1)) (.cse0 (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)))) (and (or .cse0 (not .cse1)) (let ((.cse2 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse2 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse2 (<= 2 .cse3) (<= .cse3 2)) (and .cse2 .cse1))) (or (< .cse3 2) .cse0 (< 2 .cse3)) (= |old(#valid)| |#valid|)))) Eliminated clause: (exists ((|old(#memory_$Pointer$#1.offset)| (Array Int (Array Int Int))) (|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_$Pointer$#1.base)| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (let ((.cse0 (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) (.cse2 (= .cse4 2)) (.cse1 (= .cse4 1))) (and (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) (let ((.cse3 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse3 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse3 .cse2) (and .cse3 .cse1))))))) [2024-11-17 04:07:09,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-17 04:07:09,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-17 04:07:09,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-17 04:07:09,732 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-17 04:07:09,732 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-17 04:07:09,732 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-17 04:07:09,732 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put [2024-11-17 04:07:09,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:07:09 BoogieIcfgContainer [2024-11-17 04:07:09,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:07:09,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:07:09,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:07:09,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:07:09,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:45" (3/4) ... [2024-11-17 04:07:09,735 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 04:07:09,738 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-17 04:07:09,738 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-17 04:07:09,738 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2024-11-17 04:07:09,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2024-11-17 04:07:09,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-17 04:07:09,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 04:07:09,747 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 04:07:09,833 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:07:09,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 04:07:09,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:07:09,834 INFO L158 Benchmark]: Toolchain (without parser) took 25476.64ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 111.9MB in the beginning and 187.4MB in the end (delta: -75.5MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,834 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:07:09,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.15ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 137.8MB in the end (delta: -26.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.16ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 134.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,835 INFO L158 Benchmark]: Boogie Preprocessor took 48.63ms. Allocated memory is still 184.5MB. Free memory was 134.5MB in the beginning and 131.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,835 INFO L158 Benchmark]: IcfgBuilder took 420.41ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 108.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,835 INFO L158 Benchmark]: TraceAbstraction took 24326.95ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 107.2MB in the beginning and 193.7MB in the end (delta: -86.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,835 INFO L158 Benchmark]: Witness Printer took 101.15ms. Allocated memory is still 314.6MB. Free memory was 193.7MB in the beginning and 187.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 04:07:09,839 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.81ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.15ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 137.8MB in the end (delta: -26.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.16ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 134.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.63ms. Allocated memory is still 184.5MB. Free memory was 134.5MB in the beginning and 131.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 420.41ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 108.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24326.95ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 107.2MB in the beginning and 193.7MB in the end (delta: -86.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 101.15ms. Allocated memory is still 314.6MB. Free memory was 193.7MB in the beginning and 187.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put * 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: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: 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 4 procedures, 57 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 2981 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 340 IncrementalHoareTripleChecker+Unchecked, 2523 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3477 IncrementalHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 458 mSDtfsCounter, 3477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 65 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 471 ConstructedInterpolants, 10 QuantifiedInterpolants, 2512 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1496 ConjunctsInSsa, 678 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 7/31 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: -1]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 525]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Ensures: (ldv_global_msg_list == \old(ldv_global_msg_list)) RESULT: Ultimate proved your program to be correct! [2024-11-17 04:07:09,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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