./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:48:07,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:48:07,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:48:07,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:48:07,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:48:07,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:48:07,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:48:07,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:48:07,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:48:07,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:48:07,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:48:07,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:48:07,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:48:07,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:48:07,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:48:07,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:48:07,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:48:07,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:48:07,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:48:07,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:48:07,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:48:07,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:48:07,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:48:07,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:48:07,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:48:07,872 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:48:07,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:48:07,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:48:07,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:48:07,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:48:07,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:48:07,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:48:07,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:48:07,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:48:07,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:48:07,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:48:07,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:48:07,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:48:07,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:48:07,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:48:07,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:48:07,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:48:07,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:48:07,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:48:07,879 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-11-10 18:48:08,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:48:08,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:48:08,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:48:08,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:48:08,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:48:08,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-10 18:48:09,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:48:09,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:48:09,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-10 18:48:09,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89863786/206bc8c6b5c04ac8b5f97ec34d9f9bf6/FLAGbd1824776 [2024-11-10 18:48:10,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89863786/206bc8c6b5c04ac8b5f97ec34d9f9bf6 [2024-11-10 18:48:10,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:48:10,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:48:10,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:48:10,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:48:10,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:48:10,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41df7429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10, skipping insertion in model container [2024-11-10 18:48:10,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:48:10,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:48:10,671 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:48:10,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:48:10,769 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:48:10,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10 WrapperNode [2024-11-10 18:48:10,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:48:10,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:48:10,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:48:10,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:48:10,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,828 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 125 [2024-11-10 18:48:10,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:48:10,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:48:10,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:48:10,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:48:10,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,874 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-10 18:48:10,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:48:10,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:48:10,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:48:10,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:48:10,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (1/1) ... [2024-11-10 18:48:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:48:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:48:10,950 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-10 18:48:10,953 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-10 18:48:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:48:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:48:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-10 18:48:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-10 18:48:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 18:48:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 18:48:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-10 18:48:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-10 18:48:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:48:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:48:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:48:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:48:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:48:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:48:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:48:11,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:48:11,214 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:48:11,217 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:48:11,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc ldv_kref_put_#t~ret34#1; [2024-11-10 18:48:11,373 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 18:48:11,511 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-10 18:48:11,512 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:48:11,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:48:11,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:48:11,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:48:11 BoogieIcfgContainer [2024-11-10 18:48:11,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:48:11,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:48:11,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:48:11,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:48:11,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:48:10" (1/3) ... [2024-11-10 18:48:11,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dc080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:48:11, skipping insertion in model container [2024-11-10 18:48:11,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:48:10" (2/3) ... [2024-11-10 18:48:11,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dc080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:48:11, skipping insertion in model container [2024-11-10 18:48:11,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:48:11" (3/3) ... [2024-11-10 18:48:11,535 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2024-11-10 18:48:11,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:48:11,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 18:48:11,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:48:11,600 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;@520f2406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:48:11,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:48:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:48:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:48:11,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:11,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:48:11,611 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-10 18:48:11,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash 190638697, now seen corresponding path program 1 times [2024-11-10 18:48:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585955861] [2024-11-10 18:48:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:12,009 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-10 18:48:12,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585955861] [2024-11-10 18:48:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585955861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:12,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:48:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777887800] [2024-11-10 18:48:12,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:12,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:48:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:48:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:48:12,046 INFO L87 Difference]: Start difference. First operand has 55 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-10 18:48:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:12,222 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2024-11-10 18:48:12,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:48:12,225 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-10 18:48:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:12,232 INFO L225 Difference]: With dead ends: 106 [2024-11-10 18:48:12,232 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 18:48:12,235 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-10 18:48:12,239 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:12,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 18:48:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2024-11-10 18:48:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:48:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-10 18:48:12,277 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 12 [2024-11-10 18:48:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:12,277 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-10 18:48:12,277 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-10 18:48:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-10 18:48:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:48:12,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:12,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:48:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:48:12,279 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-10 18:48:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1933449032, now seen corresponding path program 1 times [2024-11-10 18:48:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277698116] [2024-11-10 18:48:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:12,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:12,429 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-10 18:48:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277698116] [2024-11-10 18:48:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277698116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:48:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093917363] [2024-11-10 18:48:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:12,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:48:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:48:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:48:12,437 INFO L87 Difference]: Start difference. First operand 44 states and 49 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-10 18:48:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:12,514 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-10 18:48:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:48:12,516 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-10 18:48:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:12,517 INFO L225 Difference]: With dead ends: 64 [2024-11-10 18:48:12,517 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 18:48:12,518 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-10 18:48:12,519 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:12,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 18:48:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-10 18:48:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:48:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-10 18:48:12,531 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 12 [2024-11-10 18:48:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-10 18:48:12,531 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-10 18:48:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-10 18:48:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:48:12,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:12,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:48:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:48:12,534 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-10 18:48:12,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash -675113574, now seen corresponding path program 1 times [2024-11-10 18:48:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467106931] [2024-11-10 18:48:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:12,769 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-10 18:48:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467106931] [2024-11-10 18:48:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467106931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:48:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281826603] [2024-11-10 18:48:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:12,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:48:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:48:12,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:48:12,772 INFO L87 Difference]: Start difference. First operand 46 states and 51 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-10 18:48:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:12,874 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-10 18:48:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:48:12,874 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-10 18:48:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:12,876 INFO L225 Difference]: With dead ends: 75 [2024-11-10 18:48:12,877 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 18:48:12,877 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-10 18:48:12,879 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:12,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 188 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 18:48:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-10 18:48:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:48:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-10 18:48:12,894 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 17 [2024-11-10 18:48:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:12,895 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-10 18:48:12,895 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-10 18:48:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-10 18:48:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:48:12,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:12,897 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-10 18:48:12,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:48:12,898 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-10 18:48:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 545817765, now seen corresponding path program 1 times [2024-11-10 18:48:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158657324] [2024-11-10 18:48:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,088 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-10 18:48:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158657324] [2024-11-10 18:48:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158657324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:48:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890215097] [2024-11-10 18:48:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:48:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:48:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:48:13,094 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-10 18:48:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:13,196 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-10 18:48:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:48:13,196 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), 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-10 18:48:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:13,197 INFO L225 Difference]: With dead ends: 59 [2024-11-10 18:48:13,198 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 18:48:13,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:48:13,199 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:13,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 210 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 18:48:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 18:48:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:48:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-10 18:48:13,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 18 [2024-11-10 18:48:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:13,211 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-10 18:48:13,211 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), 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-10 18:48:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-10 18:48:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:48:13,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:13,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:48:13,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:48:13,213 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-10 18:48:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -968516581, now seen corresponding path program 1 times [2024-11-10 18:48:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503986835] [2024-11-10 18:48:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,329 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-10 18:48:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503986835] [2024-11-10 18:48:13,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503986835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:13,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:48:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152263640] [2024-11-10 18:48:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:13,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:48:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:48:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:48:13,332 INFO L87 Difference]: Start difference. First operand 47 states and 52 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-10 18:48:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:13,390 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-10 18:48:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:48:13,391 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-10 18:48:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:13,391 INFO L225 Difference]: With dead ends: 74 [2024-11-10 18:48:13,392 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 18:48:13,392 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-10 18:48:13,393 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:13,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:48:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 18:48:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 18:48:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 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-10 18:48:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-10 18:48:13,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 17 [2024-11-10 18:48:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:13,398 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-10 18:48:13,398 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-10 18:48:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-10 18:48:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:48:13,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:13,399 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-10 18:48:13,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:48:13,399 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-10 18:48:13,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1769484524, now seen corresponding path program 1 times [2024-11-10 18:48:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900047327] [2024-11-10 18:48:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,497 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-10 18:48:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900047327] [2024-11-10 18:48:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900047327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:13,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:13,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:48:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471295095] [2024-11-10 18:48:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:48:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:48:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:48:13,500 INFO L87 Difference]: Start difference. First operand 39 states and 41 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-10 18:48:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:13,586 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-10 18:48:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:48:13,587 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-10 18:48:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:13,588 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:48:13,589 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 18:48:13,589 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-10 18:48:13,590 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:13,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 159 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 18:48:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 18:48:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 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-10 18:48:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-10 18:48:13,599 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 18 [2024-11-10 18:48:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-10 18:48:13,599 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-10 18:48:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-10 18:48:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:48:13,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:13,600 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-10 18:48:13,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:48:13,600 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-10 18:48:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 85580095, now seen corresponding path program 1 times [2024-11-10 18:48:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707550529] [2024-11-10 18:48:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 18:48:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:13,748 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-10 18:48:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707550529] [2024-11-10 18:48:13,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707550529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:13,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:13,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:48:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554052559] [2024-11-10 18:48:13,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:13,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:48:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:13,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:48:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:48:13,753 INFO L87 Difference]: Start difference. First operand 39 states and 40 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-10 18:48:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:13,828 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-11-10 18:48:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:48:13,828 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-10 18:48:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:13,829 INFO L225 Difference]: With dead ends: 69 [2024-11-10 18:48:13,829 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 18:48:13,829 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-10 18:48:13,830 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:13,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 18:48:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 18:48:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 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-10 18:48:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-10 18:48:13,839 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 23 [2024-11-10 18:48:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-10 18:48:13,839 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-10 18:48:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-10 18:48:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 18:48:13,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:13,840 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-10 18:48:13,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:48:13,841 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-10 18:48:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1441098736, now seen corresponding path program 1 times [2024-11-10 18:48:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795149622] [2024-11-10 18:48:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:14,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 18:48:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:14,035 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-10 18:48:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795149622] [2024-11-10 18:48:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795149622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:48:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473993672] [2024-11-10 18:48:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:48:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:48:14,040 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-10 18:48:14,042 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-10 18:48:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:14,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-10 18:48:14,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:48:14,285 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-10 18:48:14,360 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-10 18:48:14,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:14,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:14,402 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-10 18:48:14,462 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-10 18:48:14,483 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-10 18:48:14,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:48:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473993672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:48:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-10 18:48:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728548859] [2024-11-10 18:48:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:48:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:48:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-10 18:48:14,485 INFO L87 Difference]: Start difference. First operand 40 states and 41 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-10 18:48:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:14,627 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-10 18:48:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:48:14,627 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-10 18:48:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:14,628 INFO L225 Difference]: With dead ends: 40 [2024-11-10 18:48:14,628 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 18:48:14,628 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-10 18:48:14,629 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:14,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 139 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2024-11-10 18:48:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 18:48:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 18:48:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 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-10 18:48:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-10 18:48:14,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 24 [2024-11-10 18:48:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:14,639 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-10 18:48:14,639 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-10 18:48:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-10 18:48:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:48:14,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:14,641 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-10 18:48:14,659 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-10 18:48:14,845 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-10 18:48:14,846 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-10 18:48:14,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:14,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1724387841, now seen corresponding path program 1 times [2024-11-10 18:48:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738256079] [2024-11-10 18:48:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 18:48:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,045 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-10 18:48:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738256079] [2024-11-10 18:48:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738256079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:48:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256962088] [2024-11-10 18:48:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:48:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:48:15,049 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-10 18:48:15,052 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-10 18:48:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-10 18:48:15,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:48:15,243 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-10 18:48:15,313 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-10 18:48:15,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:15,346 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-10 18:48:15,412 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-10 18:48:15,432 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-10 18:48:15,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:48:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256962088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:48:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-10 18:48:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145788305] [2024-11-10 18:48:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:15,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:48:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:48:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-10 18:48:15,434 INFO L87 Difference]: Start difference. First operand 39 states and 40 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-10 18:48:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:15,551 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-10 18:48:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:48:15,552 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-10 18:48:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:15,553 INFO L225 Difference]: With dead ends: 40 [2024-11-10 18:48:15,553 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 18:48:15,553 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-10 18:48:15,554 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:15,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2024-11-10 18:48:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 18:48:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-10 18:48:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 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-10 18:48:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-10 18:48:15,559 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 25 [2024-11-10 18:48:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-10 18:48:15,559 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-10 18:48:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-10 18:48:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 18:48:15,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:15,560 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-10 18:48:15,578 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-10 18:48:15,764 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-10 18:48:15,765 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-10 18:48:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1695134867, now seen corresponding path program 1 times [2024-11-10 18:48:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879776736] [2024-11-10 18:48:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 18:48:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:15,935 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-10 18:48:15,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:15,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879776736] [2024-11-10 18:48:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879776736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:48:15,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:48:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:48:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708642737] [2024-11-10 18:48:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:48:15,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:48:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:48:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:48:15,938 INFO L87 Difference]: Start difference. First operand 38 states and 39 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-10 18:48:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:16,064 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2024-11-10 18:48:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:48:16,064 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-10 18:48:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:16,065 INFO L225 Difference]: With dead ends: 48 [2024-11-10 18:48:16,065 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 18:48:16,065 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-10 18:48:16,066 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:16,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 121 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:48:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 18:48:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 18:48:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 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-10 18:48:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-10 18:48:16,074 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 30 [2024-11-10 18:48:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-11-10 18:48:16,075 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-10 18:48:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-10 18:48:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 18:48:16,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:16,079 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-10 18:48:16,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:48:16,079 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-10 18:48:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1362636191, now seen corresponding path program 1 times [2024-11-10 18:48:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175470245] [2024-11-10 18:48:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 18:48:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:16,325 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-10 18:48:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175470245] [2024-11-10 18:48:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175470245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:48:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009995650] [2024-11-10 18:48:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:48:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:48:16,327 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-10 18:48:16,328 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-10 18:48:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:16,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-10 18:48:16,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:48:16,620 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-10 18:48:16,685 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-10 18:48:16,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:16,706 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-10 18:48:16,875 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-10 18:48:17,007 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-10 18:48:17,028 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-10 18:48:17,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:48:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009995650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:48:19,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:48:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18] total 23 [2024-11-10 18:48:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158295082] [2024-11-10 18:48:19,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:48:19,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 18:48:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:48:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 18:48:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=847, Unknown=1, NotChecked=58, Total=992 [2024-11-10 18:48:19,293 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 18 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-10 18:48:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:48:19,860 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2024-11-10 18:48:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 18:48:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 18 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-10 18:48:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:48:19,861 INFO L225 Difference]: With dead ends: 65 [2024-11-10 18:48:19,861 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 18:48:19,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=1485, Unknown=2, NotChecked=78, Total=1722 [2024-11-10 18:48:19,863 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:48:19,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 158 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 378 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2024-11-10 18:48:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 18:48:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 18:48:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-10 18:48:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-10 18:48:19,868 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2024-11-10 18:48:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:48:19,869 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-11-10 18:48:19,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 18 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-10 18:48:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-10 18:48:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 18:48:19,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:48:19,871 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-10 18:48:19,889 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-10 18:48:20,071 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-10 18:48:20,072 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-10 18:48:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:48:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 801217157, now seen corresponding path program 1 times [2024-11-10 18:48:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:48:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511816180] [2024-11-10 18:48:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:48:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:48:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:48:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:20,279 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-10 18:48:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:48:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511816180] [2024-11-10 18:48:20,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511816180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:48:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544452510] [2024-11-10 18:48:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:48:20,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:48:20,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:48:20,281 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-10 18:48:20,282 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-10 18:48:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:48:20,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-10 18:48:20,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:48:20,583 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-10 18:48:20,649 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-10 18:48:20,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:20,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:48:20,666 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-10 18:48:20,829 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-10 18:48:20,936 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-10 18:48:20,966 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-10 18:48:20,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:49:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544452510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:49:13,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:49:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 25 [2024-11-10 18:49:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193425565] [2024-11-10 18:49:13,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:49:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 18:49:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 18:49:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=950, Unknown=13, NotChecked=62, Total=1122 [2024-11-10 18:49:13,770 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 20 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-10 18:49:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:32,424 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2024-11-10 18:49:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 18:49:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 20 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-10 18:49:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:32,425 INFO L225 Difference]: With dead ends: 64 [2024-11-10 18:49:32,425 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:49:32,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=158, Invalid=1470, Unknown=16, NotChecked=78, Total=1722 [2024-11-10 18:49:32,429 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 161 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 36 Unchecked, 4.7s Time] [2024-11-10 18:49:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:49:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:49:32,429 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-10 18:49:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:49:32,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-11-10 18:49:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:49:32,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 20 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-10 18:49:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:49:32,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:49:32,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 18:49:32,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 18:49:32,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 18:49:32,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 18:49:32,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:49:32,635 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-10 18:49:32,639 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:32,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:49:36,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:49:36,377 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-10 18:49:36,382 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 18:49:36,383 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 18:49:36,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-10 18:49:36,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-10 18:49:36,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-10 18:49:36,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-10 18:49:36,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-10 18:49:36,389 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-10 18:49:36,389 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-10 18:49:36,389 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-10 18:49:36,393 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-10 18:49:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 18:49:36,397 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-10 18:49:36,397 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-10 18:49:36,398 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-10 18:49:36,398 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-10 18:49:36,401 WARN L156 FloydHoareUtils]: Requires clause for ldv_kobject_put contained old-variable. Original clause: (let ((.cse1 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (and (let ((.cse0 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse0 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse0 (<= 2 .cse1) (<= .cse1 2)))) (or (< .cse1 2) (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|)) (< 2 .cse1)) (= |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 ((.cse1 (= (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12) 2))) (and (let ((.cse0 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse0 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse0 .cse1))) (or (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|)) (not .cse1))))) [2024-11-10 18:49:36,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 18:49:36,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-10 18:49:36,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-10 18:49:36,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-10 18:49:36,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 18:49:36,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-10 18:49:36,412 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-10 18:49:36,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-10 18:49:36,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-10 18:49:36,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-10 18:49:36,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put [2024-11-10 18:49:36,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:49:36 BoogieIcfgContainer [2024-11-10 18:49:36,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:49:36,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:49:36,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:49:36,415 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:49:36,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:48:11" (3/4) ... [2024-11-10 18:49:36,420 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:49:36,424 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-10 18:49:36,425 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-10 18:49:36,425 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2024-11-10 18:49:36,432 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2024-11-10 18:49:36,433 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-10 18:49:36,433 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:49:36,433 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:49:36,538 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:49:36,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:49:36,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:49:36,539 INFO L158 Benchmark]: Toolchain (without parser) took 86333.07ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 83.5MB in the beginning and 141.7MB in the end (delta: -58.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,539 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 163.6MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:49:36,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.39ms. Allocated memory is still 163.6MB. Free memory was 83.2MB in the beginning and 122.7MB in the end (delta: -39.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.45ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:49:36,540 INFO L158 Benchmark]: Boogie Preprocessor took 72.50ms. Allocated memory is still 163.6MB. Free memory was 120.7MB in the beginning and 116.5MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,540 INFO L158 Benchmark]: IcfgBuilder took 626.89ms. Allocated memory is still 163.6MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,541 INFO L158 Benchmark]: TraceAbstraction took 84882.53ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 112.0MB in the beginning and 149.1MB in the end (delta: -37.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,541 INFO L158 Benchmark]: Witness Printer took 124.99ms. Allocated memory is still 249.6MB. Free memory was 149.1MB in the beginning and 141.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:49:36,542 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.99ms. Allocated memory is still 163.6MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.39ms. Allocated memory is still 163.6MB. Free memory was 83.2MB in the beginning and 122.7MB in the end (delta: -39.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.45ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.50ms. Allocated memory is still 163.6MB. Free memory was 120.7MB in the beginning and 116.5MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 626.89ms. Allocated memory is still 163.6MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 84882.53ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 112.0MB in the beginning and 149.1MB in the end (delta: -37.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 124.99ms. Allocated memory is still 249.6MB. Free memory was 149.1MB in the beginning and 141.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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!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: ~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, 55 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 81.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1838 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 178 IncrementalHoareTripleChecker+Unchecked, 1501 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1638 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 337 mSDtfsCounter, 1638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 70.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 118, 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, 12 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 58.6s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 373 ConstructedInterpolants, 8 QuantifiedInterpolants, 1769 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1041 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/13 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-10 18:49:36,759 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 18:49:36,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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE