/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_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:46:31,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:46:31,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:46:31,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:46:31,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:46:31,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:46:31,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:46:31,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:46:31,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:46:31,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:46:31,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:46:31,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:46:31,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:46:31,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:46:31,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:46:31,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:46:31,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:46:31,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:46:31,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:46:31,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:46:31,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:46:31,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:46:31,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:46:31,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:46:31,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:46:31,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:46:31,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:46:31,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:46:31,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:46:31,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:46:31,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:46:31,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:46:31,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:46:31,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:46:31,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:46:31,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:46:31,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:46:31,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:46:31,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:46:31,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:46:31,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:46:31,136 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,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:46:31,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:46:31,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:46:31,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:46:31,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:46:31,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:46:31,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:46:31,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:46:31,199 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:46:31,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:46:31,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:46:31,201 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:46:31,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:46:31,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:46:31,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:46:31,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:46:31,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:46:31,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:46:31,202 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:46:31,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:46:31,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:46:31,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:46:31,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:46:31,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:46:31,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:46:31,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:46:31,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:31,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:46:31,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:46:31,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:46:31,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:46:31,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:46:31,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:46:31,206 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,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:46:31,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:46:31,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:46:31,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:46:31,698 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:46:31,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-10-16 13:46:31,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53957e571/8947d28dee2c49ca819d6a5818f335b7/FLAGeead58d2b [2022-10-16 13:46:32,518 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:46:32,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-10-16 13:46:32,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53957e571/8947d28dee2c49ca819d6a5818f335b7/FLAGeead58d2b [2022-10-16 13:46:32,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53957e571/8947d28dee2c49ca819d6a5818f335b7 [2022-10-16 13:46:32,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:46:32,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:46:32,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:32,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:46:32,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:46:32,758 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,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fea52ed 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,759 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,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:46:32,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:46:33,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:33,382 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:46:33,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:33,487 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:46:33,488 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,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:33,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:33,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:46:33,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:46:33,498 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,524 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,559 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-10-16 13:46:33,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:33,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:46:33,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:46:33,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:46:33,571 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,571 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,576 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,577 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,588 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,593 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,596 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,597 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,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:46:33,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:46:33,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:46:33,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:46:33,604 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,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:33,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:33,643 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,686 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,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:46:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:46:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-10-16 13:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-10-16 13:46:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:46:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:46:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:46:33,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:46:33,959 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:46:33,965 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:46:34,314 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:46:34,323 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:46:34,323 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:46:34,326 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,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:46:34,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:46:34,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:46:34,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:46:34,337 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,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1c77c3 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,340 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,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1c77c3 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,341 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,343 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-10-16 13:46:34,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:46:34,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 13:46:34,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:46:34,484 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;@34d60d5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:46:34,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 13:46:34,494 INFO L276 IsEmpty]: Start isEmpty. 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), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 13:46:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:46:34,506 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:34,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:34,507 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,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -846947467, now seen corresponding path program 1 times [2022-10-16 13:46:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:34,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280813617] [2022-10-16 13:46:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,080 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,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:35,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280813617] [2022-10-16 13:46:35,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280813617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:35,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:35,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757116384] [2022-10-16 13:46:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:35,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:35,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:35,131 INFO L87 Difference]: Start difference. First 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), 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,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:35,359 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-10-16 13:46:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:35,362 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,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:35,375 INFO L225 Difference]: With dead ends: 122 [2022-10-16 13:46:35,375 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 13:46:35,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:35,385 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 281 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,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 281 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,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 13:46:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-10-16 13:46:35,441 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-10-16 13:46:35,446 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-10-16 13:46:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:35,447 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-10-16 13:46:35,448 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,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-10-16 13:46:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:46:35,449 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:35,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:35,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:46:35,450 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,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 895862868, now seen corresponding path program 1 times [2022-10-16 13:46:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694128251] [2022-10-16 13:46:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,618 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,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:35,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694128251] [2022-10-16 13:46:35,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694128251] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:35,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:35,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561049013] [2022-10-16 13:46:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:35,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:35,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:35,623 INFO L87 Difference]: Start difference. First operand 54 states and 63 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,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:35,766 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-10-16 13:46:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:35,767 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,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:35,769 INFO L225 Difference]: With dead ends: 100 [2022-10-16 13:46:35,769 INFO L226 Difference]: Without dead ends: 72 [2022-10-16 13:46:35,771 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,773 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 162 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,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 162 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,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-16 13:46:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2022-10-16 13:46:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 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,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-10-16 13:46:35,788 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2022-10-16 13:46:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:35,789 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-10-16 13:46:35,789 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,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-10-16 13:46:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 13:46:35,791 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:35,791 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,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:46:35,791 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,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 366281122, now seen corresponding path program 1 times [2022-10-16 13:46:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:35,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254262046] [2022-10-16 13:46:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,012 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,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254262046] [2022-10-16 13:46:36,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254262046] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:36,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038088655] [2022-10-16 13:46:36,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:36,017 INFO L87 Difference]: Start difference. First operand 56 states and 65 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,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:36,250 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-10-16 13:46:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:46:36,251 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,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:36,258 INFO L225 Difference]: With dead ends: 113 [2022-10-16 13:46:36,259 INFO L226 Difference]: Without dead ends: 82 [2022-10-16 13:46:36,260 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,267 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 292 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:36,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 292 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:46:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-16 13:46:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-10-16 13:46:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-10-16 13:46:36,302 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2022-10-16 13:46:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-10-16 13:46:36,303 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,303 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-10-16 13:46:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 13:46:36,305 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:36,305 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,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:46:36,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash 495363841, now seen corresponding path program 1 times [2022-10-16 13:46:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:36,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366747770] [2022-10-16 13:46:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,567 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,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366747770] [2022-10-16 13:46:36,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366747770] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167081075] [2022-10-16 13:46:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:36,571 INFO L87 Difference]: Start difference. First operand 59 states and 69 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,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:36,688 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-10-16 13:46:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:36,688 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,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:36,690 INFO L225 Difference]: With dead ends: 107 [2022-10-16 13:46:36,690 INFO L226 Difference]: Without dead ends: 66 [2022-10-16 13:46:36,691 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,693 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:36,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 197 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-16 13:46:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-10-16 13:46:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 49 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:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-10-16 13:46:36,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2022-10-16 13:46:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:36,703 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-10-16 13:46:36,704 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,704 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-10-16 13:46:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:36,708 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:36,709 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,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:46:36,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash -835975854, now seen corresponding path program 1 times [2022-10-16 13:46:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:36,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150538404] [2022-10-16 13:46:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:36,928 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,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150538404] [2022-10-16 13:46:36,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150538404] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:36,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:36,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:46:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870198593] [2022-10-16 13:46:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:36,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:46:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:46:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:36,934 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:37,151 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-10-16 13:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:46:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 13:46:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:37,155 INFO L225 Difference]: With dead ends: 90 [2022-10-16 13:46:37,159 INFO L226 Difference]: Without dead ends: 56 [2022-10-16 13:46:37,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:46:37,169 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:37,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 267 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-16 13:46:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-10-16 13:46:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-10-16 13:46:37,187 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2022-10-16 13:46:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:37,187 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-10-16 13:46:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-10-16 13:46:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:37,191 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:37,191 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:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:46:37,192 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:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1292786891, now seen corresponding path program 1 times [2022-10-16 13:46:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:37,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405435911] [2022-10-16 13:46:37,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,367 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,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:37,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405435911] [2022-10-16 13:46:37,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405435911] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:37,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:37,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:46:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319509801] [2022-10-16 13:46:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:37,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:46:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:46:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:37,371 INFO L87 Difference]: Start difference. First operand 50 states and 56 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,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:37,521 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-10-16 13:46:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:37,522 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,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:37,523 INFO L225 Difference]: With dead ends: 86 [2022-10-16 13:46:37,523 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 13:46:37,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:46:37,525 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 165 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,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 165 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,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 13:46:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-10-16 13:46:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-16 13:46:37,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2022-10-16 13:46:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:37,533 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-16 13:46:37,533 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,534 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-16 13:46:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 13:46:37,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:37,535 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,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:46:37,535 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,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 259861478, now seen corresponding path program 1 times [2022-10-16 13:46:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543712480] [2022-10-16 13:46:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:46:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,700 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,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:37,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543712480] [2022-10-16 13:46:37,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543712480] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:37,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:37,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928922282] [2022-10-16 13:46:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:37,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:37,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:37,703 INFO L87 Difference]: Start difference. First operand 50 states and 55 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,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:37,795 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-10-16 13:46:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:37,796 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,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:37,797 INFO L225 Difference]: With dead ends: 97 [2022-10-16 13:46:37,797 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 13:46:37,798 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,799 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 128 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,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 128 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,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 13:46:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-10-16 13:46:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-10-16 13:46:37,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2022-10-16 13:46:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:37,807 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-10-16 13:46:37,808 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,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-10-16 13:46:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 13:46:37,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:37,809 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,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 13:46:37,809 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,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 451023015, now seen corresponding path program 1 times [2022-10-16 13:46:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:37,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244822212] [2022-10-16 13:46:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:37,992 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,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:37,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244822212] [2022-10-16 13:46:37,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244822212] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938678618] [2022-10-16 13:46:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:37,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:37,998 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:38,019 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:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:38,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 93 conjunts are in the unsatisfiable core [2022-10-16 13:46:38,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:38,323 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:39,637 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:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:39,722 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,813 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,831 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,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:46:39,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938678618] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:39,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:46:39,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-10-16 13:46:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591798020] [2022-10-16 13:46:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:39,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 13:46:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 13:46:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-10-16 13:46:39,834 INFO L87 Difference]: Start difference. First operand 51 states and 56 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:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:40,103 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-10-16 13:46:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 13:46:40,104 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:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:40,105 INFO L225 Difference]: With dead ends: 59 [2022-10-16 13:46:40,105 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 13:46:40,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-10-16 13:46:40,107 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 66 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:40,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 254 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-10-16 13:46:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 13:46:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-10-16 13:46:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-16 13:46:40,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2022-10-16 13:46:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:40,117 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-16 13:46:40,117 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:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-16 13:46:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 13:46:40,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:40,118 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:40,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 13:46:40,334 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:40,335 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:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1096811657, now seen corresponding path program 1 times [2022-10-16 13:46:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:40,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625548476] [2022-10-16 13:46:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:40,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:40,577 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:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:40,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625548476] [2022-10-16 13:46:40,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625548476] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:40,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839585776] [2022-10-16 13:46:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:40,579 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:40,600 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,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:40,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 93 conjunts are in the unsatisfiable core [2022-10-16 13:46:40,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:40,794 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:42,433 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:42,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:42,467 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:42,551 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:42,573 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,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:46:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839585776] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:46:42,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-10-16 13:46:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621134975] [2022-10-16 13:46:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:42,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 13:46:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 13:46:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-10-16 13:46:42,576 INFO L87 Difference]: Start difference. First operand 50 states and 55 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:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:42,893 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-10-16 13:46:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 13:46:42,893 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:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:42,894 INFO L225 Difference]: With dead ends: 62 [2022-10-16 13:46:42,894 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 13:46:42,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-10-16 13:46:42,896 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:42,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 326 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 232 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-10-16 13:46:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 13:46:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-10-16 13:46:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) 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:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-10-16 13:46:42,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2022-10-16 13:46:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:42,906 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-10-16 13:46:42,906 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:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-10-16 13:46:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 13:46:42,908 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:42,908 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] [2022-10-16 13:46:42,949 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:43,121 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:43,122 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:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1913158811, now seen corresponding path program 1 times [2022-10-16 13:46:43,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:43,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469283537] [2022-10-16 13:46:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,318 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:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469283537] [2022-10-16 13:46:43,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469283537] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:43,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:43,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 13:46:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991095430] [2022-10-16 13:46:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:43,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:46:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:46:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:46:43,321 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:43,508 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-10-16 13:46:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:46:43,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-10-16 13:46:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:43,509 INFO L225 Difference]: With dead ends: 77 [2022-10-16 13:46:43,509 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:46:43,510 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:43,511 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 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:43,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 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:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:46:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-10-16 13:46:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 42 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:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-10-16 13:46:43,520 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2022-10-16 13:46:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:43,520 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-10-16 13:46:43,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-10-16 13:46:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 13:46:43,522 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:43,522 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, 1] [2022-10-16 13:46:43,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:46:43,522 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:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1920244181, now seen corresponding path program 1 times [2022-10-16 13:46:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572671334] [2022-10-16 13:46:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,743 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:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572671334] [2022-10-16 13:46:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572671334] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752623951] [2022-10-16 13:46:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:43,745 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:43,755 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:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 152 conjunts are in the unsatisfiable core [2022-10-16 13:46:43,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:44,051 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:45,253 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:45,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:45,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:45,283 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:45,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:46:45,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:46:45,447 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:45,611 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:45,635 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:45,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:00,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752623951] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:00,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:00,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20] total 25 [2022-10-16 13:47:00,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310395518] [2022-10-16 13:47:00,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:00,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 13:47:00,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 13:47:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1022, Unknown=8, NotChecked=64, Total=1190 [2022-10-16 13:47:00,333 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:07,907 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-10-16 13:47:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 13:47:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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 34 [2022-10-16 13:47:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:07,908 INFO L225 Difference]: With dead ends: 117 [2022-10-16 13:47:07,909 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 13:47:07,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=245, Invalid=2397, Unknown=14, NotChecked=100, Total=2756 [2022-10-16 13:47:07,912 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 139 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:07,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 303 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 684 Invalid, 0 Unknown, 80 Unchecked, 0.5s Time] [2022-10-16 13:47:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 13:47:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-10-16 13:47:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:47:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-10-16 13:47:07,922 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 34 [2022-10-16 13:47:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:07,923 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-10-16 13:47:07,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-10-16 13:47:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 13:47:07,924 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:07,924 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, 1] [2022-10-16 13:47:07,965 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:47:08,139 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:47:08,140 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:47:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1143461147, now seen corresponding path program 1 times [2022-10-16 13:47:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:08,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281376249] [2022-10-16 13:47:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:47:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281376249] [2022-10-16 13:47:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281376249] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993902856] [2022-10-16 13:47:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:08,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:08,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:47:08,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 13:47:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:08,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 153 conjunts are in the unsatisfiable core [2022-10-16 13:47:08,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:08,662 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:09,739 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:47:09,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:09,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:09,771 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:09,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:09,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:47:09,936 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:10,079 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:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:10,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:22,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993902856] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:22,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:22,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2022-10-16 13:47:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464199201] [2022-10-16 13:47:22,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 13:47:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 13:47:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1091, Unknown=6, NotChecked=66, Total=1260 [2022-10-16 13:47:22,560 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 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:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:29,432 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-10-16 13:47:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 13:47:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 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 36 [2022-10-16 13:47:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:29,434 INFO L225 Difference]: With dead ends: 109 [2022-10-16 13:47:29,434 INFO L226 Difference]: Without dead ends: 59 [2022-10-16 13:47:29,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=243, Invalid=2300, Unknown=11, NotChecked=98, Total=2652 [2022-10-16 13:47:29,437 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:29,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 273 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 647 Invalid, 0 Unknown, 72 Unchecked, 0.5s Time] [2022-10-16 13:47:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-16 13:47:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-10-16 13:47:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 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:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-10-16 13:47:29,447 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2022-10-16 13:47:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:29,447 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-10-16 13:47:29,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 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:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-10-16 13:47:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 13:47:29,448 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:29,449 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:29,488 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:29,662 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:29,663 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:47:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1304169571, now seen corresponding path program 1 times [2022-10-16 13:47:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:29,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512879983] [2022-10-16 13:47:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:29,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:47:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:29,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:47:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512879983] [2022-10-16 13:47:30,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512879983] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055408491] [2022-10-16 13:47:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:30,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:30,014 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:30,033 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:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:30,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 144 conjunts are in the unsatisfiable core [2022-10-16 13:47:30,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:30,249 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:31,155 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_515 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (<= (+ v_ArrVal_515 1) (select .cse0 .cse1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_515)) |c_#memory_int|)))) is different from true [2022-10-16 13:47:31,220 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:31,298 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:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 13:47:31,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055408491] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:31,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:31,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 23 [2022-10-16 13:47:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387139122] [2022-10-16 13:47:31,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:31,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 13:47:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:31,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 13:47:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2022-10-16 13:47:31,743 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 13:47:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:37,548 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-10-16 13:47:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 13:47:37,548 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2022-10-16 13:47:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:37,549 INFO L225 Difference]: With dead ends: 109 [2022-10-16 13:47:37,550 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 13:47:37,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=172, Invalid=1230, Unknown=8, NotChecked=72, Total=1482 [2022-10-16 13:47:37,551 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:37,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 372 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 383 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2022-10-16 13:47:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 13:47:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-10-16 13:47:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:47:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-10-16 13:47:37,563 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 48 [2022-10-16 13:47:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:37,564 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-10-16 13:47:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 13:47:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-10-16 13:47:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-16 13:47:37,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:37,565 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] [2022-10-16 13:47:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-16 13:47:37,779 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:37,780 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:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash -710408717, now seen corresponding path program 1 times [2022-10-16 13:47:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:37,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962620231] [2022-10-16 13:47:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 13:47:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-16 13:47:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:38,183 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:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962620231] [2022-10-16 13:47:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962620231] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783591324] [2022-10-16 13:47:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:38,185 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:38,190 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:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:38,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 198 conjunts are in the unsatisfiable core [2022-10-16 13:47:38,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:38,487 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:40,060 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_652 Int) (v_ArrVal_651 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_651) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_652))))) is different from true [2022-10-16 13:47:40,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:40,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:40,089 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:40,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:40,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:47:40,298 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:41,601 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_656 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (<= 0 (+ v_ArrVal_656 2147483648)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_656)) |c_#memory_int|) (<= (select .cse0 .cse1) (+ v_ArrVal_656 1))))) is different from true [2022-10-16 13:47:41,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:41,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:47:41,666 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:41,787 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:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:47:41,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:42,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783591324] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:42,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:42,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23] total 32 [2022-10-16 13:47:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417293206] [2022-10-16 13:47:42,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:42,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 13:47:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 13:47:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1090, Unknown=2, NotChecked=134, Total=1332 [2022-10-16 13:47:42,354 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 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:48:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:48:01,110 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-10-16 13:48:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 13:48:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-10-16 13:48:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:48:01,113 INFO L225 Difference]: With dead ends: 118 [2022-10-16 13:48:01,113 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 13:48:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=282, Invalid=2788, Unknown=18, NotChecked=218, Total=3306 [2022-10-16 13:48:01,116 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 100 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:48:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 338 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 575 Invalid, 0 Unknown, 203 Unchecked, 0.5s Time] [2022-10-16 13:48:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 13:48:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-16 13:48:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.0625) internal successors, (51), 49 states have internal predecessors, (51), 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:48:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-10-16 13:48:01,125 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2022-10-16 13:48:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:48:01,125 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-10-16 13:48:01,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 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:48:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-10-16 13:48:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 13:48:01,126 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:48:01,127 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:48:01,166 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:48:01,327 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:48:01,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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:48:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:48:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash -990130780, now seen corresponding path program 1 times [2022-10-16 13:48:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:48:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648186042] [2022-10-16 13:48:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:48:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:48:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:48:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 13:48:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 13:48:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:48:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:48:01,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648186042] [2022-10-16 13:48:01,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648186042] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:48:01,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451156891] [2022-10-16 13:48:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:48:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:48:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:48:01,804 INFO L229 MonitoredProcess]: Starting monitored process 8 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:48:01,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 13:48:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:01,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 203 conjunts are in the unsatisfiable core [2022-10-16 13:48:01,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:48:02,185 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:48:03,843 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_808 Int) (v_ArrVal_807 Int) (LDV_INIT_LIST_HEAD_~list.offset 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_807) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_808))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-10-16 13:48:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:48:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:48:03,869 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:48:04,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:48:04,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:48:04,068 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:48:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:48:07,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:48:07,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451156891] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:48:07,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:48:07,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24] total 33 [2022-10-16 13:48:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582491156] [2022-10-16 13:48:07,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:48:07,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 13:48:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:48:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 13:48:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1234, Unknown=1, NotChecked=70, Total=1406 [2022-10-16 13:48:07,767 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 33 states, 32 states have (on average 2.6875) internal successors, (86), 28 states have internal predecessors, (86), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:48:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:48:16,989 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2022-10-16 13:48:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 13:48:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 28 states have internal predecessors, (86), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-10-16 13:48:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:48:16,990 INFO L225 Difference]: With dead ends: 92 [2022-10-16 13:48:16,990 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 13:48:16,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=248, Invalid=2941, Unknown=7, NotChecked=110, Total=3306 [2022-10-16 13:48:16,993 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:48:16,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 317 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 505 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2022-10-16 13:48:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 13:48:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 13:48:16,994 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:48:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 13:48:16,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-10-16 13:48:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:48:16,995 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 13:48:16,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 28 states have internal predecessors, (86), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:48:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 13:48:16,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 13:48:16,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-10-16 13:48:16,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-10-16 13:48:16,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-10-16 13:48:16,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-10-16 13:48:17,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-16 13:48:17,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:48:17,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 13:48:22,271 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 81 DAG size of output: 72 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 13:48:28,051 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 75 DAG size of output: 57 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 13:48:34,750 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 75 DAG size of output: 57 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 13:48:35,074 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:35,075 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-10-16 13:48:35,075 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:35,075 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:35,075 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-10-16 13:48:35,075 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-10-16 13:48:35,075 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-10-16 13:48:35,076 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-10-16 13:48:35,076 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-10-16 13:48:35,076 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse5 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse4 1) .cse0 (not .cse2) .cse1 (<= .cse5 1) (<= 1 .cse4) (<= 1 .cse5) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse3) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))))) [2022-10-16 13:48:35,077 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-10-16 13:48:35,077 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-10-16 13:48:35,077 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:48:35,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-10-16 13:48:35,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 13:48:35,077 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:35,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 13:48:35,078 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-10-16 13:48:35,078 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-10-16 13:48:35,078 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:35,078 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:35,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-10-16 13:48:35,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 13:48:35,079 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse0 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (<= 1 (select .cse0 12)) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= (select .cse0 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) 2147483646) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) .cse2 (<= (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12) 2) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) .cse3)) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse3 .cse1))) [2022-10-16 13:48:35,079 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-10-16 13:48:35,079 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:35,079 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:35,080 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-10-16 13:48:35,080 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:35,080 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 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 (<= (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12) 2) (= (+ |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)) .cse3 (<= (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_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= |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 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse3 .cse1))) [2022-10-16 13:48:35,080 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-10-16 13:48:35,080 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 759) no Hoare annotation was computed. [2022-10-16 13:48:35,081 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-10-16 13:48:35,081 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-10-16 13:48:35,081 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 772) no Hoare annotation was computed. [2022-10-16 13:48:35,081 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:35,081 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:35,081 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:35,082 INFO L895 garLoopResultBuilder]: At program point L669(lines 663 670) the Hoare annotation is: (let ((.cse2 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse4 (select .cse2 .cse3)) (.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse0 (select .cse2 12))) (and (or (not (<= .cse0 2)) .cse1 (not (<= 2 .cse0)) (and (exists ((v_ArrVal_814 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse2 .cse3 v_ArrVal_814))) (<= v_ArrVal_814 2147483647) (<= v_ArrVal_814 |ldv_kobject_put_ldv_atomic_sub_return_#res#1|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_515 Int)) (and (<= (+ v_ArrVal_515 1) .cse4) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse2 .cse3 v_ArrVal_515)) |#memory_int|))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (exists ((v_ArrVal_656 Int)) (and (<= .cse4 (+ v_ArrVal_656 1)) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse2 .cse3 v_ArrVal_656))) (<= 0 (+ v_ArrVal_656 2147483648)))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or (not (<= .cse4 2147483646)) .cse1 (not (<= 1 .cse0)) (= |old(#valid)| |#valid|))))) [2022-10-16 13:48:35,082 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-10-16 13:48:35,082 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-10-16 13:48:35,083 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse3 12))) (or (not (<= .cse0 2)) .cse1 (not (<= 2 .cse0)) (let ((.cse4 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse2 (select .cse3 .cse4))) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_515 Int)) (and (<= (+ v_ArrVal_515 1) .cse2) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse4 v_ArrVal_515)) |#memory_int|))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (= |old(#valid)| |#valid|) (exists ((v_ArrVal_656 Int)) (and (<= .cse2 (+ v_ArrVal_656 1)) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse4 v_ArrVal_656))) (<= 0 (+ v_ArrVal_656 2147483648)))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:48:35,083 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:35,083 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 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) 2147483646)) .cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2) (not (<= 1 (select .cse0 12))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-10-16 13:48:35,084 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-10-16 13:48:35,084 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse3 12))) (or (not (<= .cse0 2)) .cse1 (not (<= 2 .cse0)) (let ((.cse4 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse2 (select .cse3 .cse4))) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_515 Int)) (and (<= (+ v_ArrVal_515 1) .cse2) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse4 v_ArrVal_515)) |#memory_int|))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (= |old(#valid)| |#valid|) (exists ((v_ArrVal_656 Int)) (and (<= .cse2 (+ v_ArrVal_656 1)) (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse4 v_ArrVal_656))) (<= 0 (+ v_ArrVal_656 2147483648)))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:48:35,084 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:35,084 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:35,085 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-10-16 13:48:35,085 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-10-16 13:48:35,085 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 (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-10-16 13:48:35,085 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-10-16 13:48:35,085 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-10-16 13:48:35,085 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:35,089 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:48:35,092 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:48:35,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:48:35 BoogieIcfgContainer [2022-10-16 13:48:35,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:48:35,176 INFO L158 Benchmark]: Toolchain (without parser) took 122428.54ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 136.3MB in the beginning and 137.3MB in the end (delta: -1.0MB). Peak memory consumption was 137.8MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,177 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 163.6MB. Free memory was 133.2MB in the beginning and 133.1MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:48:35,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.52ms. Allocated memory is still 163.6MB. Free memory was 136.2MB in the beginning and 115.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.30ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 112.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,179 INFO L158 Benchmark]: Boogie Preprocessor took 41.59ms. Allocated memory is still 163.6MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,179 INFO L158 Benchmark]: RCFGBuilder took 723.82ms. Allocated memory is still 163.6MB. Free memory was 110.6MB in the beginning and 128.5MB in the end (delta: -17.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,180 INFO L158 Benchmark]: TraceAbstraction took 120845.95ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 127.4MB in the beginning and 137.3MB in the end (delta: -9.9MB). Peak memory consumption was 129.5MB. Max. memory is 8.0GB. [2022-10-16 13:48:35,182 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 163.6MB. Free memory was 133.2MB in the beginning and 133.1MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 734.52ms. Allocated memory is still 163.6MB. Free memory was 136.2MB in the beginning and 115.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.30ms. Allocated memory is still 163.6MB. Free memory was 115.2MB in the beginning and 112.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.59ms. Allocated memory is still 163.6MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 723.82ms. Allocated memory is still 163.6MB. Free memory was 110.6MB in the beginning and 128.5MB in the end (delta: -17.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * TraceAbstraction took 120845.95ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 127.4MB in the beginning and 137.3MB in the end (delta: -9.9MB). Peak memory consumption was 129.5MB. 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_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,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, 54 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 120.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 941 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 930 mSDsluCounter, 3835 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 759 IncrementalHoareTripleChecker+Unchecked, 3152 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4125 IncrementalHoareTripleChecker+Invalid, 5144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 683 mSDtfsCounter, 4125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 88.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=13, InterpolantAutomatonStates: 211, 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, 15 MinimizatonAttempts, 128 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 179 PreInvPairs, 293 NumberOfFragments, 1014 HoareAnnotationTreeSize, 179 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2213 FormulaSimplificationTreeSizeReductionInter, 17.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 48.9s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 665 ConstructedInterpolants, 34 QuantifiedInterpolants, 3901 SizeOfPredicates, 414 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 1036 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 31/95 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:35,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_814,QUANTIFIED] [2022-10-16 13:48:35,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((\exists v_ArrVal_814 : int :: (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_814]] && v_ArrVal_814 <= 2147483647) && v_ArrVal_814 <= \result) && temp <= 2) && kobj == 0) && (\exists v_ArrVal_515 : int :: v_ArrVal_515 + 1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12] && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_515]] == unknown-#memory_int-unknown)) && unknown-#memory_int-unknown[kobj][12] <= 2) && (\exists v_ArrVal_656 : int :: (\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_656 + 1 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_656]]) && 0 <= v_ArrVal_656 + 2147483648)) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0))) && (((!(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483646) || !(kobj == 0)) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || \old(\valid) == \valid) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((0 == kobj && 0 == \result) && kobj == 0) && \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)) && !(\result == 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:35,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_515 : int :: v_ArrVal_515 + 1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12] && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_515]] == unknown-#memory_int-unknown)) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && (\exists v_ArrVal_656 : int :: (\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_656 + 1 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_656]]) && 0 <= v_ArrVal_656 + 2147483648)) && 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)) || !(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:35,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_515,QUANTIFIED] [2022-10-16 13:48:35,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] [2022-10-16 13:48:35,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_656,QUANTIFIED] Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_515 : int :: v_ArrVal_515 + 1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12] && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_515]] == unknown-#memory_int-unknown)) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && (\exists v_ArrVal_656 : int :: (\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_656 + 1 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_656]]) && 0 <= v_ArrVal_656 + 2147483648)) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-10-16 13:48:35,429 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-10-16 13:48:35,441 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 137 Received shutdown request...