/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_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:46:31,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:46:31,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:46:31,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:46:31,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:46:31,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:46:31,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:46:31,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:46:31,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:46:31,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:46:31,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:46:31,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:46:31,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:46:31,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:46:31,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:46:31,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:46:31,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:46:31,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:46:31,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:46:31,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:46:31,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:46:31,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:46:31,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:46:31,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:46:31,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:46:31,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:46:31,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:46:31,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:46:31,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:46:31,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:46:31,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:46:31,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:46:31,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:46:31,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:46:31,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:46:31,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:46:31,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:46:31,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:46:31,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:46:31,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:46:31,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:46:31,234 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:31,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:46:31,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:46:31,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:46:31,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:46:31,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:46:31,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:46:31,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:46:31,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:46:31,297 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:46:31,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:46:31,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:46:31,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:46:31,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:46:31,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:46:31,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:46:31,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:46:31,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:46:31,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:46:31,300 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:46:31,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:46:31,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:46:31,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:46:31,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:46:31,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:46:31,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:46:31,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:46:31,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:31,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:46:31,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:46:31,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:46:31,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:46:31,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:46:31,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:46:31,304 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:31,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:46:31,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:46:31,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:46:31,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:46:31,741 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:46:31,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-10-16 13:46:31,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41f9e880/5bf6cbe25a2f4d6a869327b1d7a6519b/FLAG9d2cfc9c1 [2022-10-16 13:46:32,525 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:46:32,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-10-16 13:46:32,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41f9e880/5bf6cbe25a2f4d6a869327b1d7a6519b/FLAG9d2cfc9c1 [2022-10-16 13:46:32,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41f9e880/5bf6cbe25a2f4d6a869327b1d7a6519b [2022-10-16 13:46:32,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:46:32,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:46:32,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:32,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:46:32,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:46:32,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:32" (1/1) ... [2022-10-16 13:46:32,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7478be15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:32, skipping insertion in model container [2022-10-16 13:46:32,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:32" (1/1) ... [2022-10-16 13:46:32,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:46:32,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:46:33,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:33,416 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:46:33,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:33,571 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:46:33,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:33 WrapperNode [2022-10-16 13:46:33,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:33,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:33,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:46:33,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:46:33,585 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:33" (1/1) ... [2022-10-16 13:46:33,613 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:33" (1/1) ... [2022-10-16 13:46:33,657 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 121 [2022-10-16 13:46:33,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:33,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:46:33,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:46:33,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:46:33,669 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:33" (1/1) ... [2022-10-16 13:46:33,669 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:33" (1/1) ... [2022-10-16 13:46:33,674 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:33" (1/1) ... [2022-10-16 13:46:33,674 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:33" (1/1) ... [2022-10-16 13:46:33,686 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:33" (1/1) ... [2022-10-16 13:46:33,691 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:33" (1/1) ... [2022-10-16 13:46:33,693 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:33" (1/1) ... [2022-10-16 13:46:33,695 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:33" (1/1) ... [2022-10-16 13:46:33,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:46:33,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:46:33,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:46:33,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:46:33,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:33" (1/1) ... [2022-10-16 13:46:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:33,746 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:33,756 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:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:46:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:46:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-10-16 13:46:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:46:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:46:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:46:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:46:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:46:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:46:33,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:46:34,025 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:46:34,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:46:34,410 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:46:34,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:46:34,419 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:46:34,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:34 BoogieIcfgContainer [2022-10-16 13:46:34,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:46:34,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:46:34,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:46:34,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:46:34,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:32" (1/3) ... [2022-10-16 13:46:34,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670b5328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:34, skipping insertion in model container [2022-10-16 13:46:34,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:33" (2/3) ... [2022-10-16 13:46:34,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670b5328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:34, skipping insertion in model container [2022-10-16 13:46:34,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:34" (3/3) ... [2022-10-16 13:46:34,437 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-10-16 13:46:34,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:46:34,461 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 13:46:34,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:46:34,567 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;@318764c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:46:34,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 13:46:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:46:34,582 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:34,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:34,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash -175410051, now seen corresponding path program 1 times [2022-10-16 13:46:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:34,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401123912] [2022-10-16 13:46:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,211 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:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:35,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401123912] [2022-10-16 13:46:35,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401123912] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:35,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:35,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390143375] [2022-10-16 13:46:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:35,260 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:35,473 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2022-10-16 13:46:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:35,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-10-16 13:46:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:35,498 INFO L225 Difference]: With dead ends: 116 [2022-10-16 13:46:35,499 INFO L226 Difference]: Without dead ends: 76 [2022-10-16 13:46:35,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:35,514 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 263 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.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:35,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 263 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-16 13:46:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2022-10-16 13:46:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-10-16 13:46:35,587 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 12 [2022-10-16 13:46:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:35,587 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-10-16 13:46:35,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-10-16 13:46:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:46:35,589 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:35,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:35,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:46:35,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1567400284, now seen corresponding path program 1 times [2022-10-16 13:46:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:35,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830511861] [2022-10-16 13:46:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,757 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:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:35,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830511861] [2022-10-16 13:46:35,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830511861] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:35,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:35,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661494128] [2022-10-16 13:46:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:35,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:35,762 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:35,889 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-10-16 13:46:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:35,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-10-16 13:46:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:35,892 INFO L225 Difference]: With dead ends: 92 [2022-10-16 13:46:35,893 INFO L226 Difference]: Without dead ends: 66 [2022-10-16 13:46:35,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:35,896 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 153 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-16 13:46:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-10-16 13:46:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 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:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-10-16 13:46:35,910 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-10-16 13:46:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:35,910 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-10-16 13:46:35,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-10-16 13:46:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 13:46:35,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:35,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:35,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:46:35,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1120397654, now seen corresponding path program 1 times [2022-10-16 13:46:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524336395] [2022-10-16 13:46:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,088 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:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524336395] [2022-10-16 13:46:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524336395] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191359922] [2022-10-16 13:46:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:36,092 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:36,226 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2022-10-16 13:46:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:46:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-16 13:46:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:36,229 INFO L225 Difference]: With dead ends: 107 [2022-10-16 13:46:36,229 INFO L226 Difference]: Without dead ends: 78 [2022-10-16 13:46:36,230 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:36,231 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 272 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:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 272 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:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-16 13:46:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2022-10-16 13:46:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 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:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-10-16 13:46:36,243 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 16 [2022-10-16 13:46:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:36,244 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-10-16 13:46:36,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-10-16 13:46:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 13:46:36,245 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:36,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:36,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:46:36,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1500438086, now seen corresponding path program 1 times [2022-10-16 13:46:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809918107] [2022-10-16 13:46:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,427 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:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809918107] [2022-10-16 13:46:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809918107] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487503909] [2022-10-16 13:46:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:36,440 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:36,595 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-10-16 13:46:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2022-10-16 13:46:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:36,597 INFO L225 Difference]: With dead ends: 88 [2022-10-16 13:46:36,597 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 13:46:36,598 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:36,600 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:36,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 228 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 13:46:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-10-16 13:46:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 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:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-10-16 13:46:36,609 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2022-10-16 13:46:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:36,609 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-10-16 13:46:36,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-10-16 13:46:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 13:46:36,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:36,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:36,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:46:36,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -991314935, now seen corresponding path program 1 times [2022-10-16 13:46:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:36,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553240268] [2022-10-16 13:46:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,735 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:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553240268] [2022-10-16 13:46:36,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553240268] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857649377] [2022-10-16 13:46:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:36,739 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:36,829 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-10-16 13:46:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:36,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-16 13:46:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:36,830 INFO L225 Difference]: With dead ends: 95 [2022-10-16 13:46:36,831 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 13:46:36,831 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:36,833 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:36,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 13:46:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-10-16 13:46:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 42 states have internal predecessors, (47), 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:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-10-16 13:46:36,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 16 [2022-10-16 13:46:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:36,840 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-10-16 13:46:36,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-10-16 13:46:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:36,841 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:36,842 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:36,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:46:36,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1476374573, now seen corresponding path program 1 times [2022-10-16 13:46:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:36,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310111519] [2022-10-16 13:46:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,949 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:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310111519] [2022-10-16 13:46:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310111519] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:46:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992620848] [2022-10-16 13:46:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:46:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:46:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:36,953 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:37,122 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-10-16 13:46:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 13:46:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:37,124 INFO L225 Difference]: With dead ends: 82 [2022-10-16 13:46:37,124 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 13:46:37,125 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:37,126 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 157 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:37,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 157 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:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 13:46:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-10-16 13:46:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 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:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-10-16 13:46:37,135 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2022-10-16 13:46:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:37,135 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-10-16 13:46:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-10-16 13:46:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 13:46:37,136 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:37,137 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] [2022-10-16 13:46:37,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:46:37,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -814801186, now seen corresponding path program 1 times [2022-10-16 13:46:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:37,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613600097] [2022-10-16 13:46:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:46:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,298 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:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:37,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613600097] [2022-10-16 13:46:37,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613600097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:37,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:37,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983259502] [2022-10-16 13:46:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:37,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:37,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:37,302 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:37,400 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-10-16 13:46:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-10-16 13:46:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:37,402 INFO L225 Difference]: With dead ends: 93 [2022-10-16 13:46:37,402 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:46:37,403 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:37,404 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:37,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:46:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-10-16 13:46:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.236842105263158) internal successors, (47), 42 states have internal predecessors, (47), 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:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-10-16 13:46:37,412 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2022-10-16 13:46:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:37,413 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-10-16 13:46:37,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-10-16 13:46:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 13:46:37,414 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:37,414 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] [2022-10-16 13:46:37,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 13:46:37,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 595648175, now seen corresponding path program 1 times [2022-10-16 13:46:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:37,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319533456] [2022-10-16 13:46:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,664 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:46:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:37,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319533456] [2022-10-16 13:46:37,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319533456] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:37,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608063865] [2022-10-16 13:46:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:37,678 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:37,703 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:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 85 conjunts are in the unsatisfiable core [2022-10-16 13:46:37,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:37,976 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:46:38,942 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_107 Int) (v_ArrVal_106 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_107) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_106)) |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:46:38,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:38,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:38,994 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:46:39,088 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:46:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:46:39,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:46:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608063865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:39,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:46:39,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-10-16 13:46:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275731093] [2022-10-16 13:46:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:39,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 13:46:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 13:46:39,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-10-16 13:46:39,144 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:39,452 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-10-16 13:46:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 13:46:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-10-16 13:46:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:39,454 INFO L225 Difference]: With dead ends: 55 [2022-10-16 13:46:39,454 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 13:46:39,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-10-16 13:46:39,457 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 285 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-10-16 13:46:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 13:46:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-10-16 13:46:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 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:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-10-16 13:46:39,480 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2022-10-16 13:46:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-10-16 13:46:39,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-10-16 13:46:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 13:46:39,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:39,482 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:39,526 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:39,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:39,696 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1285224321, now seen corresponding path program 1 times [2022-10-16 13:46:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865382924] [2022-10-16 13:46:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:39,903 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:46:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:39,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865382924] [2022-10-16 13:46:39,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865382924] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:39,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490126286] [2022-10-16 13:46:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:39,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:39,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:39,918 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:46:39,940 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:46:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:40,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 85 conjunts are in the unsatisfiable core [2022-10-16 13:46:40,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:40,155 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:46:41,449 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_174 Int) (v_ArrVal_171 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_174) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_171)) |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:46:41,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:41,482 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:46:41,560 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:46:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:46:41,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:46:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490126286] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:41,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:46:41,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-10-16 13:46:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455342317] [2022-10-16 13:46:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 13:46:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 13:46:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-10-16 13:46:41,587 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:41,897 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-10-16 13:46:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 13:46:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-10-16 13:46:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:41,899 INFO L225 Difference]: With dead ends: 56 [2022-10-16 13:46:41,899 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:46:41,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-10-16 13:46:41,900 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 288 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-10-16 13:46:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:46:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-10-16 13:46:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 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:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-10-16 13:46:41,909 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2022-10-16 13:46:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:41,910 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-10-16 13:46:41,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-10-16 13:46:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 13:46:41,911 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:41,911 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, 1, 1, 1] [2022-10-16 13:46:41,948 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:46:42,124 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,SelfDestructingSolverStorable8 [2022-10-16 13:46:42,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 842874951, now seen corresponding path program 1 times [2022-10-16 13:46:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394634636] [2022-10-16 13:46:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:46:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394634636] [2022-10-16 13:46:42,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394634636] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:42,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:42,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 13:46:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462327599] [2022-10-16 13:46:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:42,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:46:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:46:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:46:42,286 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:42,474 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-10-16 13:46:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:46:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-10-16 13:46:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:42,476 INFO L225 Difference]: With dead ends: 73 [2022-10-16 13:46:42,476 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 13:46:42,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:46:42,477 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:42,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 150 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 13:46:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-10-16 13:46:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 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:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-10-16 13:46:42,486 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2022-10-16 13:46:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:42,487 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-10-16 13:46:42,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-10-16 13:46:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 13:46:42,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:42,488 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:42,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:46:42,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash 221950145, now seen corresponding path program 1 times [2022-10-16 13:46:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:42,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520116537] [2022-10-16 13:46:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,721 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:46:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:42,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520116537] [2022-10-16 13:46:42,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520116537] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:42,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141698726] [2022-10-16 13:46:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:42,724 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:46:42,726 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:46:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 136 conjunts are in the unsatisfiable core [2022-10-16 13:46:42,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:43,052 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:46:44,196 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_286 Int) (v_ArrVal_285 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_285) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_286))))) is different from true [2022-10-16 13:46:44,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:44,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:44,239 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:46:44,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:46:44,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:46:44,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-10-16 13:46:44,524 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:46:44,546 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:46:44,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:46:46,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 Int) (v_ArrVal_297 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_4 Int)) (or (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_4) (< (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_298) (+ v_LDV_INIT_LIST_HEAD_~list.offset_4 4) v_ArrVal_297)) |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:46:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141698726] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:46,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:46:46,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2022-10-16 13:46:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628827154] [2022-10-16 13:46:46,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:46:46,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 13:46:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 13:46:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=847, Unknown=2, NotChecked=118, Total=1056 [2022-10-16 13:46:46,583 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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:46:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:53,741 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-10-16 13:46:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:46:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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 33 [2022-10-16 13:46:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:53,743 INFO L225 Difference]: With dead ends: 89 [2022-10-16 13:46:53,743 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 13:46:53,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=222, Invalid=1940, Unknown=8, NotChecked=182, Total=2352 [2022-10-16 13:46:53,745 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 105 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:53,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 235 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 525 Invalid, 0 Unknown, 65 Unchecked, 0.4s Time] [2022-10-16 13:46:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 13:46:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-10-16 13:46:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-10-16 13:46:53,756 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2022-10-16 13:46:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:53,756 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-10-16 13:46:53,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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:46:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-10-16 13:46:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 13:46:53,757 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:53,758 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:53,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 13:46:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:53,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:46:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1814803623, now seen corresponding path program 1 times [2022-10-16 13:46:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:53,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113576114] [2022-10-16 13:46:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:46:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:54,315 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:46:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113576114] [2022-10-16 13:46:54,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113576114] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886101475] [2022-10-16 13:46:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:54,318 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:46:54,322 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:46:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:54,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 137 conjunts are in the unsatisfiable core [2022-10-16 13:46:54,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:54,576 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:46:55,942 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_388 Int) (v_ArrVal_385 Int) (LDV_INIT_LIST_HEAD_~list.offset 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_385) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_388)) |c_#memory_int|))) is different from true [2022-10-16 13:46:55,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:55,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:55,978 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:46:56,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:46:56,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:46:56,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-10-16 13:46:56,282 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:46:56,310 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:46:56,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886101475] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:09,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:09,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 25 [2022-10-16 13:47:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546909608] [2022-10-16 13:47:09,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:09,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 13:47:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 13:47:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=962, Unknown=6, NotChecked=62, Total=1122 [2022-10-16 13:47:09,499 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:47:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:16,508 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-10-16 13:47:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:47:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-10-16 13:47:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:16,510 INFO L225 Difference]: With dead ends: 96 [2022-10-16 13:47:16,510 INFO L226 Difference]: Without dead ends: 56 [2022-10-16 13:47:16,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=219, Invalid=2030, Unknown=11, NotChecked=92, Total=2352 [2022-10-16 13:47:16,514 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 87 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:16,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 230 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 577 Invalid, 0 Unknown, 71 Unchecked, 0.4s Time] [2022-10-16 13:47:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-16 13:47:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-10-16 13:47:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-10-16 13:47:16,523 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2022-10-16 13:47:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:16,524 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-10-16 13:47:16,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:47:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-10-16 13:47:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 13:47:16,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:16,526 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2022-10-16 13:47:16,566 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:16,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:16,741 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:47:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -874011441, now seen corresponding path program 1 times [2022-10-16 13:47:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:16,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139254211] [2022-10-16 13:47:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:47:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-16 13:47:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139254211] [2022-10-16 13:47:17,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139254211] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394570961] [2022-10-16 13:47:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:17,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:17,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:17,066 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:17,068 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:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 187 conjunts are in the unsatisfiable core [2022-10-16 13:47:17,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:17,360 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:19,119 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_518 Int) (v_ArrVal_516 Int)) (and (= |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_518) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_516))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-10-16 13:47:19,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:19,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:19,165 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:19,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:19,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:47:19,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-10-16 13:47:22,243 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse0 (select .cse1 .cse2))) (or (and (exists ((v_ArrVal_521 Int)) (and (<= .cse0 (+ v_ArrVal_521 1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse1 .cse2 v_ArrVal_521)) |c_#memory_int|))) (<= .cse0 0)) (exists ((v_ArrVal_521 Int)) (and (<= .cse0 (+ v_ArrVal_521 1)) (<= 1 v_ArrVal_521) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse1 .cse2 v_ArrVal_521)) |c_#memory_int|)))))) is different from true [2022-10-16 13:47:22,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-10-16 13:47:22,461 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,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:47:22,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:25,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_10 Int) (v_ArrVal_534 Int)) (or (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_10) (< 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_10 v_ArrVal_533) (+ v_LDV_INIT_LIST_HEAD_~list.offset_10 4) v_ArrVal_534)) |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:25,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394570961] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:25,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:25,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25] total 33 [2022-10-16 13:47:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632092560] [2022-10-16 13:47:25,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 13:47:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 13:47:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1894, Unknown=3, NotChecked=270, Total=2352 [2022-10-16 13:47:25,928 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 26 states have internal predecessors, (78), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:47:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:36,450 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-10-16 13:47:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 13:47:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 26 states have internal predecessors, (78), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-10-16 13:47:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:36,451 INFO L225 Difference]: With dead ends: 101 [2022-10-16 13:47:36,451 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 13:47:36,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=395, Invalid=3766, Unknown=11, NotChecked=384, Total=4556 [2022-10-16 13:47:36,454 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:36,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 239 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 428 Invalid, 0 Unknown, 215 Unchecked, 0.3s Time] [2022-10-16 13:47:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 13:47:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-16 13:47:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 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:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-10-16 13:47:36,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2022-10-16 13:47:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:36,464 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-10-16 13:47:36,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 26 states have internal predecessors, (78), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:47:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-10-16 13:47:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 13:47:36,466 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:36,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:36,492 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:36,672 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,SelfDestructingSolverStorable12 [2022-10-16 13:47:36,673 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 13:47:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -494783673, now seen corresponding path program 1 times [2022-10-16 13:47:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904797151] [2022-10-16 13:47:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 13:47:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:37,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:47:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:37,102 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:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904797151] [2022-10-16 13:47:37,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904797151] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:37,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456492016] [2022-10-16 13:47:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:37,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:37,104 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:37,106 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:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:37,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 93 conjunts are in the unsatisfiable core [2022-10-16 13:47:37,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:37,348 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:37,519 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:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 13:47:37,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:37,944 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:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 13:47:37,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456492016] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:47:37,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:47:37,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2022-10-16 13:47:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863911525] [2022-10-16 13:47:37,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:37,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 13:47:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 13:47:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-10-16 13:47:37,977 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 21 states have internal predecessors, (98), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:47:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:38,935 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-10-16 13:47:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:47:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 21 states have internal predecessors, (98), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2022-10-16 13:47:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:38,937 INFO L225 Difference]: With dead ends: 102 [2022-10-16 13:47:38,937 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 13:47:38,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2022-10-16 13:47:38,942 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 86 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:38,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 664 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 13:47:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 13:47:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 13:47:38,944 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:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 13:47:38,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-10-16 13:47:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:38,944 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 13:47:38,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 21 states have internal predecessors, (98), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:47:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 13:47:38,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 13:47:38,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-10-16 13:47:38,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-10-16 13:47:38,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-10-16 13:47:38,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-10-16 13:47:38,978 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:39,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:39,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 13:48:04,816 WARN L233 SmtUtils]: Spent 23.11s on a formula simplification. DAG size of input: 74 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 13:48:28,189 WARN L233 SmtUtils]: Spent 23.04s on a formula simplification. DAG size of input: 74 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 13:48:28,604 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:48:28,604 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-10-16 13:48:28,604 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:28,605 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:28,605 INFO L899 garLoopResultBuilder]: For program point L762(lines 757 763) no Hoare annotation was computed. [2022-10-16 13:48:28,605 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-10-16 13:48:28,605 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-10-16 13:48:28,605 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-10-16 13:48:28,606 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-10-16 13:48:28,606 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-10-16 13:48:28,606 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse1 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= .cse2 1) (<= 1 .cse1) (<= 1 .cse2) (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:48:28,606 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-10-16 13:48:28,606 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-10-16 13:48:28,606 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:48:28,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-10-16 13:48:28,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 13:48:28,607 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:48:28,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 13:48:28,607 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-10-16 13:48:28,607 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-10-16 13:48:28,607 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 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|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-10-16 13:48:28,608 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (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:48:28,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-10-16 13:48:28,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 13:48:28,608 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 766) no Hoare annotation was computed. [2022-10-16 13:48:28,608 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (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:48:28,609 INFO L895 garLoopResultBuilder]: At program point L661(lines 655 662) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (<= .cse0 2) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse0))) [2022-10-16 13:48:28,609 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-10-16 13:48:28,609 INFO L895 garLoopResultBuilder]: At program point L719(lines 715 720) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) (<= .cse2 2) .cse3 (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse2))) (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse3 .cse1))) [2022-10-16 13:48:28,609 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) (<= .cse2 2) .cse3 (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse2))) (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse3 .cse1))) [2022-10-16 13:48:28,610 INFO L895 garLoopResultBuilder]: At program point L761-1(line 761) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse0 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse1 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse0) (<= (select .cse1 12) 2) .cse2 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 0 (select .cse1 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse0))) [2022-10-16 13:48:28,610 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-10-16 13:48:28,610 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-10-16 13:48:28,610 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:48:28,610 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:28,610 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:28,611 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|))) (let ((.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse5 (select .cse4 12))) (let ((.cse1 (not (<= .cse5 2))) (.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (select .cse4 .cse3))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or .cse1 .cse0 (not (<= 0 .cse2)) (= |old(#valid)| |#valid|)) (or .cse1 .cse0 (and (<= .cse2 (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse3) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (exists ((v_ArrVal_521 Int)) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| v_ArrVal_521) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse4 .cse3 v_ArrVal_521))))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |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 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)) (not (<= 2 .cse5))))))) [2022-10-16 13:48:28,611 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-10-16 13:48:28,611 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-10-16 13:48:28,612 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|)) (.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse11 12)) (.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse7 (<= (select .cse4 12) 2)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (<= 2 .cse0)) (and .cse3 .cse5 .cse6 .cse7 (exists ((v_ArrVal_521 Int)) (and (<= 1 v_ArrVal_521) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse8 .cse9)))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-10-16 13:48:28,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:28,613 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (= |old(#valid)| |#valid|))) (and (let ((.cse0 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or (not (<= (select .cse0 12) 2)) .cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2) (not (<= 0 (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-10-16 13:48:28,613 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-10-16 13:48:28,613 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|)) (.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse11 12)) (.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse7 (<= (select .cse4 12) 2)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (<= 2 .cse0)) (and .cse3 .cse5 .cse6 .cse7 (exists ((v_ArrVal_521 Int)) (and (<= 1 v_ArrVal_521) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse8 .cse9)))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-10-16 13:48:28,614 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:28,614 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:28,614 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-10-16 13:48:28,614 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-10-16 13:48:28,614 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse3 (select |#memory_int| |ldv_kobject_put_~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|) (<= 0 (select .cse3 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .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) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:48:28,615 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-10-16 13:48:28,615 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-10-16 13:48:28,615 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:28,619 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:48:28,622 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:48:28,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,651 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,651 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,666 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:48:28 BoogieIcfgContainer [2022-10-16 13:48:28,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:48:28,670 INFO L158 Benchmark]: Toolchain (without parser) took 115854.85ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 124.2MB in the beginning and 101.6MB in the end (delta: 22.6MB). Peak memory consumption was 121.0MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,670 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 152.0MB. Free memory was 122.3MB in the beginning and 122.2MB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:48:28,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.65ms. Allocated memory is still 152.0MB. Free memory was 124.0MB in the beginning and 103.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.33ms. Allocated memory is still 152.0MB. Free memory was 103.2MB in the beginning and 133.8MB in the end (delta: -30.5MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,671 INFO L158 Benchmark]: Boogie Preprocessor took 41.69ms. Allocated memory is still 152.0MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,672 INFO L158 Benchmark]: RCFGBuilder took 720.96ms. Allocated memory is still 152.0MB. Free memory was 131.7MB in the beginning and 113.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,672 INFO L158 Benchmark]: TraceAbstraction took 114244.93ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 112.8MB in the beginning and 101.6MB in the end (delta: 11.2MB). Peak memory consumption was 109.2MB. Max. memory is 8.0GB. [2022-10-16 13:48:28,674 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.26ms. Allocated memory is still 152.0MB. Free memory was 122.3MB in the beginning and 122.2MB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 750.65ms. Allocated memory is still 152.0MB. Free memory was 124.0MB in the beginning and 103.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.33ms. Allocated memory is still 152.0MB. Free memory was 103.2MB in the beginning and 133.8MB in the end (delta: -30.5MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.69ms. Allocated memory is still 152.0MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 720.96ms. Allocated memory is still 152.0MB. Free memory was 131.7MB in the beginning and 113.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 114244.93ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 112.8MB in the beginning and 101.6MB in the end (delta: 11.2MB). Peak memory consumption was 109.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] * 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: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - 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, 52 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 114.1s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 3470 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 487 IncrementalHoareTripleChecker+Unchecked, 2834 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3357 IncrementalHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 636 mSDtfsCounter, 3357 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 53.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 179, 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, 14 MinimizatonAttempts, 107 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 163 PreInvPairs, 340 NumberOfFragments, 1054 HoareAnnotationTreeSize, 163 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2779 FormulaSimplificationTreeSizeReductionInter, 49.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 606 ConstructedInterpolants, 16 QuantifiedInterpolants, 3176 SizeOfPredicates, 297 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 723 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 27/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12] - InvariantResult [Line: 663]: Loop Invariant [2022-10-16 13:48:28,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((!(kobj == 0) || !(kobj == 0)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || \old(\valid) == \valid)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= \result + 1 && v == kobj + 12) && kobj == kobj) && (\exists v_ArrVal_521 : int :: \result <= v_ArrVal_521 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]])) && temp <= 2) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (0 == \result && \result == 0) || ((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant [2022-10-16 13:48:28,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && (\exists v_ArrVal_521 : int :: (1 <= v_ArrVal_521 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]]) && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-10-16 13:48:28,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-10-16 13:48:28,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && (\exists v_ArrVal_521 : int :: (1 <= v_ArrVal_521 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]]) && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-10-16 13:48:28,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...