/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:46:52,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:46:52,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:46:52,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:46:52,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:46:52,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:46:52,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:46:52,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:46:52,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:46:52,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:46:52,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:46:52,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:46:52,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:46:52,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:46:52,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:46:52,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:46:52,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:46:52,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:46:52,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:46:52,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:46:52,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:46:52,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:46:52,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:46:52,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:46:52,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:46:52,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:46:52,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:46:52,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:46:52,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:46:52,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:46:52,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:46:52,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:46:52,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:46:52,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:46:52,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:46:52,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:46:52,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:46:52,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:46:52,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:46:52,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:46:52,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:46:52,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 13:46:52,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:46:52,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:46:52,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:46:52,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:46:52,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:46:52,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:46:52,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:46:52,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:46:52,202 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:46:52,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:46:52,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:46:52,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:46:52,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:46:52,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:46:52,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:46:52,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:46:52,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:46:52,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:46:52,206 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:46:52,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:46:52,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:46:52,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:46:52,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:46:52,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:46:52,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:46:52,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:46:52,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:52,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:46:52,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:46:52,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:46:52,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:46:52,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:46:52,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:46:52,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 13:46:52,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:46:52,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:46:52,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:46:52,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:46:52,656 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:46:52,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-10-16 13:46:52,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fd8b2e/cc06a7c0893248278bef04575c637cf4/FLAGd28fc9839 [2022-10-16 13:46:53,509 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:46:53,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-10-16 13:46:53,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fd8b2e/cc06a7c0893248278bef04575c637cf4/FLAGd28fc9839 [2022-10-16 13:46:53,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fd8b2e/cc06a7c0893248278bef04575c637cf4 [2022-10-16 13:46:53,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:46:53,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:46:53,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:53,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:46:53,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:46:53,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:53" (1/1) ... [2022-10-16 13:46:53,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49473aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:53, skipping insertion in model container [2022-10-16 13:46:53,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:53" (1/1) ... [2022-10-16 13:46:53,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:46:53,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:46:54,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:54,568 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:46:54,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:54,716 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:46:54,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54 WrapperNode [2022-10-16 13:46:54,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:54,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:54,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:46:54,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:46:54,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,815 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 100 [2022-10-16 13:46:54,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:54,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:46:54,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:46:54,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:46:54,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:46:54,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:46:54,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:46:54,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:46:54,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2022-10-16 13:46:54,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:54,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 13:46:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 13:46:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:46:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:55,039 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:46:55,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:46:55,040 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-10-16 13:46:55,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-10-16 13:46:55,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:46:55,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:46:55,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:46:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:46:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:46:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:46:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:46:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:46:55,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:46:55,274 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:46:55,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:46:55,609 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:46:55,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:46:55,618 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:46:55,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:55 BoogieIcfgContainer [2022-10-16 13:46:55,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:46:55,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:46:55,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:46:55,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:46:55,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:53" (1/3) ... [2022-10-16 13:46:55,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203b6686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:55, skipping insertion in model container [2022-10-16 13:46:55,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (2/3) ... [2022-10-16 13:46:55,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203b6686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:55, skipping insertion in model container [2022-10-16 13:46:55,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:55" (3/3) ... [2022-10-16 13:46:55,631 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2022-10-16 13:46:55,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:46:55,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 13:46:55,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:46:55,728 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@eb4170b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:46:55,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 13:46:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 13:46:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 13:46:55,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:55,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:55,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash 922450517, now seen corresponding path program 1 times [2022-10-16 13:46:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:55,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337292994] [2022-10-16 13:46:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:56,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337292994] [2022-10-16 13:46:56,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337292994] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:56,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61264247] [2022-10-16 13:46:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:56,368 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-10-16 13:46:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:56,585 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-10-16 13:46:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-10-16 13:46:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:56,603 INFO L225 Difference]: With dead ends: 92 [2022-10-16 13:46:56,604 INFO L226 Difference]: Without dead ends: 60 [2022-10-16 13:46:56,608 INFO L412 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 [2022-10-16 13:46:56,613 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:56,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:46:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-16 13:46:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-10-16 13:46:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-10-16 13:46:56,671 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 14 [2022-10-16 13:46:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:56,672 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-10-16 13:46:56,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-10-16 13:46:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-10-16 13:46:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 13:46:56,673 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:56,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:56,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:46:56,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 725937012, now seen corresponding path program 1 times [2022-10-16 13:46:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:56,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688038104] [2022-10-16 13:46:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:56,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688038104] [2022-10-16 13:46:56,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688038104] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:56,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:56,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321603440] [2022-10-16 13:46:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:56,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:56,981 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-10-16 13:46:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:57,184 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-10-16 13:46:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 14 [2022-10-16 13:46:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:57,187 INFO L225 Difference]: With dead ends: 76 [2022-10-16 13:46:57,187 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 13:46:57,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-16 13:46:57,190 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:57,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 178 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 13:46:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-10-16 13:46:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-10-16 13:46:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-10-16 13:46:57,204 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 14 [2022-10-16 13:46:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:57,206 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-10-16 13:46:57,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-10-16 13:46:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-10-16 13:46:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:57,208 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:57,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:57,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:46:57,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1532107198, now seen corresponding path program 1 times [2022-10-16 13:46:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:57,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634045501] [2022-10-16 13:46:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:57,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:57,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634045501] [2022-10-16 13:46:57,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634045501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:57,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:57,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272510109] [2022-10-16 13:46:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:57,415 INFO L87 Difference]: Start difference. First operand 50 states and 58 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) [2022-10-16 13:46:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:57,582 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-10-16 13:46:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:46:57,583 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 [2022-10-16 13:46:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:57,585 INFO L225 Difference]: With dead ends: 87 [2022-10-16 13:46:57,585 INFO L226 Difference]: Without dead ends: 66 [2022-10-16 13:46:57,586 INFO L412 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 [2022-10-16 13:46:57,588 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:57,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 182 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-16 13:46:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2022-10-16 13:46:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 45 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-10-16 13:46:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-10-16 13:46:57,601 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2022-10-16 13:46:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:57,601 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-10-16 13:46:57,601 INFO L496 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) [2022-10-16 13:46:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-10-16 13:46:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:57,603 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:57,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:46:57,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2037665823, now seen corresponding path program 1 times [2022-10-16 13:46:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:57,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965571079] [2022-10-16 13:46:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965571079] [2022-10-16 13:46:57,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965571079] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:57,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:57,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940817614] [2022-10-16 13:46:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:57,821 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 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) [2022-10-16 13:46:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:57,950 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-10-16 13:46:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:57,951 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), 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 [2022-10-16 13:46:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:57,955 INFO L225 Difference]: With dead ends: 87 [2022-10-16 13:46:57,956 INFO L226 Difference]: Without dead ends: 56 [2022-10-16 13:46:57,960 INFO L412 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 [2022-10-16 13:46:57,969 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:57,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 142 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-16 13:46:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-10-16 13:46:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-10-16 13:46:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-10-16 13:46:57,992 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2022-10-16 13:46:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:57,992 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-10-16 13:46:57,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 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) [2022-10-16 13:46:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-10-16 13:46:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 13:46:58,000 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:58,000 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:58,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:46:58,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -154342466, now seen corresponding path program 1 times [2022-10-16 13:46:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:58,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558649999] [2022-10-16 13:46:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:46:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558649999] [2022-10-16 13:46:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558649999] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:58,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751683380] [2022-10-16 13:46:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:58,224 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) [2022-10-16 13:46:58,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 13:46:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 13:46:58,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:58,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:46:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:58,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751683380] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:46:58,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:46:58,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 14 [2022-10-16 13:46:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642624503] [2022-10-16 13:46:58,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:46:58,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 13:46:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 13:46:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-10-16 13:46:58,600 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 13:46:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:58,985 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-10-16 13:46:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 13:46:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-10-16 13:46:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:58,987 INFO L225 Difference]: With dead ends: 76 [2022-10-16 13:46:58,987 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 13:46:58,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-10-16 13:46:58,990 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:58,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 211 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:46:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 13:46:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-10-16 13:46:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-10-16 13:46:58,997 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 20 [2022-10-16 13:46:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:58,998 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-10-16 13:46:58,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 13:46:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-10-16 13:46:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 13:46:58,999 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:58,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:59,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 13:46:59,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:59,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash -390719061, now seen corresponding path program 1 times [2022-10-16 13:46:59,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:59,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795194300] [2022-10-16 13:46:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:59,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795194300] [2022-10-16 13:46:59,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795194300] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:59,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:59,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:46:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674908168] [2022-10-16 13:46:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:59,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:46:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:46:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:59,338 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-10-16 13:46:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:59,468 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-10-16 13:46:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 20 [2022-10-16 13:46:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:59,470 INFO L225 Difference]: With dead ends: 66 [2022-10-16 13:46:59,470 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 13:46:59,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:46:59,472 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:59,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 121 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 13:46:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-10-16 13:46:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-10-16 13:46:59,497 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-10-16 13:46:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:59,499 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-10-16 13:46:59,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-10-16 13:46:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-10-16 13:46:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 13:46:59,501 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:59,502 INFO L195 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] [2022-10-16 13:46:59,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:46:59,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2053927098, now seen corresponding path program 1 times [2022-10-16 13:46:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480295478] [2022-10-16 13:46:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:46:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:59,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480295478] [2022-10-16 13:46:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480295478] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:59,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:59,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582894681] [2022-10-16 13:46:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:59,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:59,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:59,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:59,740 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:59,828 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-10-16 13:46:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-10-16 13:46:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:59,830 INFO L225 Difference]: With dead ends: 77 [2022-10-16 13:46:59,830 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 13:46:59,830 INFO L412 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 [2022-10-16 13:46:59,831 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:59,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 13:46:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-10-16 13:46:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-10-16 13:46:59,839 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 25 [2022-10-16 13:46:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:59,840 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-10-16 13:46:59,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-10-16 13:46:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 13:46:59,841 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:59,841 INFO L195 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] [2022-10-16 13:46:59,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 13:46:59,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 543049415, now seen corresponding path program 1 times [2022-10-16 13:46:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:59,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606601237] [2022-10-16 13:46:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:47:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:00,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606601237] [2022-10-16 13:47:00,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606601237] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:00,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941935888] [2022-10-16 13:47:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:00,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:00,046 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) [2022-10-16 13:47:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 13:47:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:00,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 113 conjunts are in the unsatisfiable core [2022-10-16 13:47:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:00,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-16 13:47:01,446 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_108 Int) (v_ArrVal_105 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_108) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_105)) |c_#memory_int|))) is different from true [2022-10-16 13:47:01,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:01,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:01,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-10-16 13:47:01,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 13:47:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:01,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:03,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_4 Int) (v_ArrVal_116 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) v_LDV_INIT_LIST_HEAD_~list.offset_4 v_ArrVal_115) (+ v_LDV_INIT_LIST_HEAD_~list.offset_4 4) v_ArrVal_116)) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 12)) 2147483649) (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_4))) is different from false [2022-10-16 13:47:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941935888] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:03,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:03,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 22 [2022-10-16 13:47:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001940084] [2022-10-16 13:47:03,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:03,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 13:47:03,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 13:47:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2022-10-16 13:47:03,612 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2022-10-16 13:47:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:10,988 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-10-16 13:47:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:47:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 26 [2022-10-16 13:47:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:10,990 INFO L225 Difference]: With dead ends: 101 [2022-10-16 13:47:10,990 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:47:10,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=8, NotChecked=162, Total=1892 [2022-10-16 13:47:10,993 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:10,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 189 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 460 Invalid, 0 Unknown, 65 Unchecked, 0.4s Time] [2022-10-16 13:47:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:47:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2022-10-16 13:47:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-10-16 13:47:11,003 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2022-10-16 13:47:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:11,003 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-10-16 13:47:11,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2022-10-16 13:47:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-10-16 13:47:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 13:47:11,005 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:11,005 INFO L195 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] [2022-10-16 13:47:11,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 13:47:11,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-16 13:47:11,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -599844542, now seen corresponding path program 1 times [2022-10-16 13:47:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891174540] [2022-10-16 13:47:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:11,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:11,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:47:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:11,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891174540] [2022-10-16 13:47:11,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891174540] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:11,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457169185] [2022-10-16 13:47:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:11,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:11,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:11,471 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) [2022-10-16 13:47:11,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 13:47:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:11,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 106 conjunts are in the unsatisfiable core [2022-10-16 13:47:11,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:11,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-16 13:47:12,651 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_193 Int) (v_ArrVal_191 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_193) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_191)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-10-16 13:47:12,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:12,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-10-16 13:47:12,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 13:47:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:12,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:14,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 Int) (v_ArrVal_201 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_7 Int)) (or (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_7) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) v_LDV_INIT_LIST_HEAD_~list.offset_7 v_ArrVal_201) (+ v_LDV_INIT_LIST_HEAD_~list.offset_7 4) v_ArrVal_202)) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 12)) 2147483648)))) is different from false [2022-10-16 13:47:14,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457169185] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:14,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:14,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2022-10-16 13:47:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867801663] [2022-10-16 13:47:14,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:14,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 13:47:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:14,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 13:47:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=542, Unknown=2, NotChecked=94, Total=702 [2022-10-16 13:47:14,248 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:20,387 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-10-16 13:47:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 13:47:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-10-16 13:47:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:20,388 INFO L225 Difference]: With dead ends: 89 [2022-10-16 13:47:20,389 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:47:20,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=137, Invalid=1054, Unknown=7, NotChecked=134, Total=1332 [2022-10-16 13:47:20,391 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:20,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 387 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time] [2022-10-16 13:47:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:47:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-10-16 13:47:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-10-16 13:47:20,401 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2022-10-16 13:47:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:20,401 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-10-16 13:47:20,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-10-16 13:47:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 13:47:20,402 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:20,403 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-16 13:47:20,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-16 13:47:20,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:20,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1324443441, now seen corresponding path program 1 times [2022-10-16 13:47:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106110782] [2022-10-16 13:47:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:47:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 13:47:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:47:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:20,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106110782] [2022-10-16 13:47:20,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106110782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:47:20,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:47:20,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-16 13:47:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535711206] [2022-10-16 13:47:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:47:20,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 13:47:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 13:47:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-10-16 13:47:20,865 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:21,109 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-10-16 13:47:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 13:47:21,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-10-16 13:47:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:21,110 INFO L225 Difference]: With dead ends: 61 [2022-10-16 13:47:21,110 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 13:47:21,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-10-16 13:47:21,112 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:21,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 151 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:47:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 13:47:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-10-16 13:47:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-10-16 13:47:21,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 34 [2022-10-16 13:47:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:21,122 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-10-16 13:47:21,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-10-16 13:47:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 13:47:21,124 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:21,124 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:21,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:47:21,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1873034631, now seen corresponding path program 1 times [2022-10-16 13:47:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:21,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735989530] [2022-10-16 13:47:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:21,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:47:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 13:47:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:21,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:21,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735989530] [2022-10-16 13:47:21,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735989530] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:21,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299328380] [2022-10-16 13:47:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:21,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:21,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:21,437 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) [2022-10-16 13:47:21,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 13:47:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:21,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 116 conjunts are in the unsatisfiable core [2022-10-16 13:47:21,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:21,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-16 13:47:22,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 13:47:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:47:22,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:22,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 24 [2022-10-16 13:47:22,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 28 [2022-10-16 13:47:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:47:22,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299328380] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:47:22,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:47:22,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 30 [2022-10-16 13:47:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365019664] [2022-10-16 13:47:22,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 13:47:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 13:47:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2022-10-16 13:47:22,517 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 30 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 13:47:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:23,527 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-10-16 13:47:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:47:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 40 [2022-10-16 13:47:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:23,535 INFO L225 Difference]: With dead ends: 85 [2022-10-16 13:47:23,535 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 13:47:23,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1942, Unknown=0, NotChecked=0, Total=2162 [2022-10-16 13:47:23,538 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 96 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:23,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 289 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 13:47:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 13:47:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-10-16 13:47:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-10-16 13:47:23,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2022-10-16 13:47:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:23,548 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-10-16 13:47:23,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 13:47:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-10-16 13:47:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 13:47:23,549 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:23,549 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:23,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 13:47:23,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:23,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 927115536, now seen corresponding path program 1 times [2022-10-16 13:47:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:23,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679832572] [2022-10-16 13:47:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 13:47:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 13:47:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679832572] [2022-10-16 13:47:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679832572] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840504639] [2022-10-16 13:47:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:24,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:47:24,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 13:47:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:24,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 116 conjunts are in the unsatisfiable core [2022-10-16 13:47:24,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:24,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-16 13:47:25,886 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_476 Int) (v_ArrVal_475 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_476) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_475))))) is different from true [2022-10-16 13:47:25,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:25,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:25,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-10-16 13:47:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 13:47:26,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:37,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840504639] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:37,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:37,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2022-10-16 13:47:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170195708] [2022-10-16 13:47:37,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:37,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 13:47:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 13:47:37,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=779, Unknown=10, NotChecked=56, Total=930 [2022-10-16 13:47:37,172 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-10-16 13:47:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:47,708 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-10-16 13:47:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 13:47:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2022-10-16 13:47:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:47,710 INFO L225 Difference]: With dead ends: 85 [2022-10-16 13:47:47,710 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 13:47:47,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=186, Invalid=1606, Unknown=18, NotChecked=82, Total=1892 [2022-10-16 13:47:47,711 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:47,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 233 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 441 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2022-10-16 13:47:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 13:47:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 13:47:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-10-16 13:47:47,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2022-10-16 13:47:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:47,721 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-10-16 13:47:47,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-10-16 13:47:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-10-16 13:47:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 13:47:47,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:47,722 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:47,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 13:47:47,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-16 13:47:47,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1975150620, now seen corresponding path program 1 times [2022-10-16 13:47:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:47,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353121306] [2022-10-16 13:47:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 13:47:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:47:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353121306] [2022-10-16 13:47:48,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353121306] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422647105] [2022-10-16 13:47:48,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:48,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:47:48,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 13:47:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:48,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 111 conjunts are in the unsatisfiable core [2022-10-16 13:47:48,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:48,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-16 13:47:49,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 13:47:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:47:49,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:49,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 28 [2022-10-16 13:47:49,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 32 [2022-10-16 13:47:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 13:47:49,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422647105] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:47:49,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:47:49,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 10] total 34 [2022-10-16 13:47:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141904924] [2022-10-16 13:47:49,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:49,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 13:47:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 13:47:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 13:47:49,581 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 34 states, 32 states have (on average 3.125) internal successors, (100), 29 states have internal predecessors, (100), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 13:47:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:50,811 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-10-16 13:47:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 13:47:50,812 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.125) internal successors, (100), 29 states have internal predecessors, (100), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 47 [2022-10-16 13:47:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:50,813 INFO L225 Difference]: With dead ends: 81 [2022-10-16 13:47:50,813 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 13:47:50,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2022-10-16 13:47:50,815 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:50,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 415 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 13:47:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 13:47:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 13:47:50,816 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) [2022-10-16 13:47:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 13:47:50,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-10-16 13:47:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:50,816 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 13:47:50,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.125) internal successors, (100), 29 states have internal predecessors, (100), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 13:47:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 13:47:50,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 13:47:50,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2022-10-16 13:47:50,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2022-10-16 13:47:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 13:47:51,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:51,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 13:47:52,352 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 13:47:52,353 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-10-16 13:47:52,353 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (not .cse2) .cse1 (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse3) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))))) [2022-10-16 13:47:52,353 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L769(lines 769 771) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L895 garLoopResultBuilder]: At program point L767(line 767) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) .cse2 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0) (not (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|)) (and .cse0 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse1))) [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 763 768) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-10-16 13:47:52,354 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-10-16 13:47:52,355 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse6 (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0)) (.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse4 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (.cse5 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and .cse0 (not .cse1) .cse2 (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse3) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) 1) .cse4 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) .cse5 (not .cse6) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= 1 (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) (+ |ULTIMATE.start_f_22_put_~kobj#1.offset| 12)))) (and .cse0 .cse6 .cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse4 .cse1 .cse5 .cse3))) [2022-10-16 13:47:52,355 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-10-16 13:47:52,355 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:47:52,355 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:47:52,355 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-10-16 13:47:52,355 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-10-16 13:47:52,355 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-10-16 13:47:52,355 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:47:52,356 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:47:52,356 INFO L895 garLoopResultBuilder]: At program point L669(lines 663 670) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse1 (select .cse4 .cse2))) (and (or .cse0 (not (<= 1 .cse1)) (let ((.cse3 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse3 .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 1) (= (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1) .cse1) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= (select .cse4 12) 1))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or .cse0 (not (<= 0 .cse1)) (not (<= .cse1 2147483647)) (= |old(#valid)| |#valid|))))) [2022-10-16 13:47:52,356 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-10-16 13:47:52,356 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-10-16 13:47:52,356 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (select .cse4 .cse2))) (or .cse0 (not (<= 1 .cse1)) (let ((.cse3 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse3 .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 1) (= (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1) .cse1) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= (select .cse4 12) 1))))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:47:52,357 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:47:52,357 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)))) (and (let ((.cse2 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (or .cse0 .cse1 (not (<= 0 .cse2)) (not (<= .cse2 2147483647)))) (or .cse0 .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:47:52,357 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-10-16 13:47:52,357 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (select .cse4 .cse2))) (or .cse0 (not (<= 1 .cse1)) (let ((.cse3 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse3 .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 1) (= (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1) .cse1) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= (select .cse4 12) 1))))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:47:52,357 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:47:52,357 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:47:52,358 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-10-16 13:47:52,358 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-10-16 13:47:52,358 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (select .cse4 .cse2))) (or .cse0 (not (<= 1 .cse1)) (let ((.cse3 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse3 .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 1) (= (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1) .cse1) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= (select .cse4 12) 1))))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:47:52,358 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-10-16 13:47:52,358 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-10-16 13:47:52,358 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:47:52,362 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:52,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:47:52,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:47:52 BoogieIcfgContainer [2022-10-16 13:47:52,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:47:52,395 INFO L158 Benchmark]: Toolchain (without parser) took 58642.44ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 123.4MB in the beginning and 90.1MB in the end (delta: 33.4MB). Peak memory consumption was 101.6MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,396 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:47:52,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 954.45ms. Allocated memory is still 151.0MB. Free memory was 123.3MB in the beginning and 102.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.58ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,397 INFO L158 Benchmark]: Boogie Preprocessor took 87.19ms. Allocated memory is still 151.0MB. Free memory was 99.8MB in the beginning and 97.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,397 INFO L158 Benchmark]: RCFGBuilder took 716.04ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 122.7MB in the end (delta: -24.8MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,398 INFO L158 Benchmark]: TraceAbstraction took 56771.61ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.2MB in the beginning and 90.1MB in the end (delta: 32.1MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. [2022-10-16 13:47:52,399 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 954.45ms. Allocated memory is still 151.0MB. Free memory was 123.3MB in the beginning and 102.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 97.58ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.19ms. Allocated memory is still 151.0MB. Free memory was 99.8MB in the beginning and 97.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 716.04ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 122.7MB in the end (delta: -24.8MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 56771.61ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.2MB in the beginning and 90.1MB in the end (delta: 32.1MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 56.7s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 715 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 709 mSDsluCounter, 2588 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 192 IncrementalHoareTripleChecker+Unchecked, 2104 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3688 IncrementalHoareTripleChecker+Invalid, 4115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 484 mSDtfsCounter, 3688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 43.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 84 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 147 PreInvPairs, 359 NumberOfFragments, 731 HoareAnnotationTreeSize, 147 FomulaSimplifications, 7221 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 15 FomulaSimplificationsInter, 2971 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 634 ConstructedInterpolants, 6 QuantifiedInterpolants, 2624 SizeOfPredicates, 237 NumberOfNonLiveVariables, 1913 ConjunctsInSsa, 585 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 61/134 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 2 specifications checked. All of them hold - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: ((((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 1) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && \result + 1 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) && 1 <= i)) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) && (!(kobj == 0) || !(kobj == 0))) && (((!(kobj == 0) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483647)) || \old(\valid) == \valid) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) || (((((((0 == kobj && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[\result][12 + \result] == 1) && !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 1) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && \result + 1 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) && 1 <= i)) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 1) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && \result + 1 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) && 1 <= i)) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 1) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && \result + 1 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) && 1 <= i)) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-10-16 13:47:52,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...