./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:02:46,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:02:46,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:02:46,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:02:46,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:02:47,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:02:47,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:02:47,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:02:47,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:02:47,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:02:47,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:02:47,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:02:47,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:02:47,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:02:47,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:02:47,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:02:47,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:02:47,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:02:47,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:02:47,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:02:47,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:02:47,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:02:47,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:02:47,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:02:47,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:02:47,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:02:47,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2024-11-07 20:02:47,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:02:47,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:02:47,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:02:47,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:02:47,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:02:47,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-07 20:02:48,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:02:48,844 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:02:48,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-07 20:02:48,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c90f409e5/015d93fd7ad8450a88313d05325330de/FLAG4cd7cbb94 [2024-11-07 20:02:48,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c90f409e5/015d93fd7ad8450a88313d05325330de [2024-11-07 20:02:48,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:02:48,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:02:48,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:02:48,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:02:48,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:02:48,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:48" (1/1) ... [2024-11-07 20:02:48,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe54f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:48, skipping insertion in model container [2024-11-07 20:02:48,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:48" (1/1) ... [2024-11-07 20:02:48,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:02:49,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:02:49,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:02:49,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:02:49,409 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:02:49,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49 WrapperNode [2024-11-07 20:02:49,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:02:49,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:02:49,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:02:49,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:02:49,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,464 INFO L138 Inliner]: procedures = 164, calls = 69, calls flagged for inlining = 23, calls inlined = 15, statements flattened = 100 [2024-11-07 20:02:49,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:02:49,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:02:49,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:02:49,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:02:49,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,506 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-07 20:02:49,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:02:49,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:02:49,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:02:49,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:02:49,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (1/1) ... [2024-11-07 20:02:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:02:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:49,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 20:02:49,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-07 20:02:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 20:02:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 20:02:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 20:02:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 20:02:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 20:02:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 20:02:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 20:02:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:02:49,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:02:49,707 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:02:49,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:02:49,919 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-07 20:02:49,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:02:49,931 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:02:49,931 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 20:02:49,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:49 BoogieIcfgContainer [2024-11-07 20:02:49,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:02:49,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:02:49,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:02:49,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:02:49,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:02:48" (1/3) ... [2024-11-07 20:02:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2343c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:49, skipping insertion in model container [2024-11-07 20:02:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:49" (2/3) ... [2024-11-07 20:02:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2343c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:49, skipping insertion in model container [2024-11-07 20:02:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:49" (3/3) ... [2024-11-07 20:02:49,940 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-2.i [2024-11-07 20:02:49,962 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:02:49,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 20:02:49,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:02:50,007 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50d535d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:02:50,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 20:02:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:02:50,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:50,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:50,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:50,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1494167465, now seen corresponding path program 1 times [2024-11-07 20:02:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516719356] [2024-11-07 20:02:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516719356] [2024-11-07 20:02:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516719356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:50,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:02:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546472883] [2024-11-07 20:02:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:50,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:02:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:02:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:50,426 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 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) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:50,516 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2024-11-07 20:02:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 20:02:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:50,525 INFO L225 Difference]: With dead ends: 70 [2024-11-07 20:02:50,526 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 20:02:50,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:50,532 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:50,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 185 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:02:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 20:02:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-11-07 20:02:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:02:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-07 20:02:50,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 12 [2024-11-07 20:02:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-07 20:02:50,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-07 20:02:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:02:50,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:50,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:02:50,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1057989496, now seen corresponding path program 1 times [2024-11-07 20:02:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:50,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511939293] [2024-11-07 20:02:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511939293] [2024-11-07 20:02:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511939293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:02:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473276642] [2024-11-07 20:02:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:02:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:02:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:02:50,711 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:50,763 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-07 20:02:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:02:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 20:02:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:50,764 INFO L225 Difference]: With dead ends: 36 [2024-11-07 20:02:50,764 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 20:02:50,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:02:50,765 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:50,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 20:02:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-07 20:02:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-07 20:02:50,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2024-11-07 20:02:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:50,769 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-07 20:02:50,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-07 20:02:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:02:50,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:50,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:50,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:02:50,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -187478954, now seen corresponding path program 1 times [2024-11-07 20:02:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013620605] [2024-11-07 20:02:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013620605] [2024-11-07 20:02:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013620605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:02:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804354357] [2024-11-07 20:02:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:02:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:50,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:02:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:02:50,937 INFO L87 Difference]: Start difference. First operand 26 states and 29 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) [2024-11-07 20:02:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,000 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-07 20:02:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:02:51,001 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 [2024-11-07 20:02:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,001 INFO L225 Difference]: With dead ends: 45 [2024-11-07 20:02:51,001 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 20:02:51,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:02:51,002 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 20:02:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-07 20:02:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 20:02:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-07 20:02:51,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2024-11-07 20:02:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,009 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-07 20:02:51,009 INFO L472 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) [2024-11-07 20:02:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-07 20:02:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:02:51,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:02:51,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -58396235, now seen corresponding path program 1 times [2024-11-07 20:02:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159117721] [2024-11-07 20:02:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159117721] [2024-11-07 20:02:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159117721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:02:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601257546] [2024-11-07 20:02:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:02:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:02:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:51,164 INFO L87 Difference]: Start difference. First operand 33 states and 37 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) [2024-11-07 20:02:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,213 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-07 20:02:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:51,214 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 [2024-11-07 20:02:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,215 INFO L225 Difference]: With dead ends: 47 [2024-11-07 20:02:51,215 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 20:02:51,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:02:51,216 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 112 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 20:02:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 20:02:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-07 20:02:51,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2024-11-07 20:02:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,220 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-07 20:02:51,220 INFO L472 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) [2024-11-07 20:02:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-07 20:02:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 20:02:51,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:51,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:02:51,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1705298623, now seen corresponding path program 1 times [2024-11-07 20:02:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647631535] [2024-11-07 20:02:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647631535] [2024-11-07 20:02:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647631535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 20:02:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340785523] [2024-11-07 20:02:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:02:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:02:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:02:51,359 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,428 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-11-07 20:02:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:02:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-07 20:02:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,429 INFO L225 Difference]: With dead ends: 34 [2024-11-07 20:02:51,430 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 20:02:51,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:02:51,430 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 20:02:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 20:02:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-07 20:02:51,434 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2024-11-07 20:02:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-07 20:02:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:02:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-07 20:02:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 20:02:51,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:02:51,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -127330700, now seen corresponding path program 1 times [2024-11-07 20:02:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796185931] [2024-11-07 20:02:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:02:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796185931] [2024-11-07 20:02:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796185931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:51,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:51,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:02:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025286927] [2024-11-07 20:02:51,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:51,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:02:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:51,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:02:51,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:02:51,586 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,655 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-11-07 20:02:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-07 20:02:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,656 INFO L225 Difference]: With dead ends: 43 [2024-11-07 20:02:51,656 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 20:02:51,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:51,658 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 20:02:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 20:02:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-07 20:02:51,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2024-11-07 20:02:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,662 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-07 20:02:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-07 20:02:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 20:02:51,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:02:51,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash -734746405, now seen corresponding path program 1 times [2024-11-07 20:02:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87182751] [2024-11-07 20:02:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87182751] [2024-11-07 20:02:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87182751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:51,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508644052] [2024-11-07 20:02:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:51,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:02:51,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 20:02:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-07 20:02:51,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 20:02:52,226 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_8 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_8 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_8 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_8 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_8)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-07 20:02:52,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:52,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:52,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-07 20:02:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 20:02:52,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:02:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508644052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:52,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:02:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-07 20:02:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202345526] [2024-11-07 20:02:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:52,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:02:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:02:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-07 20:02:52,448 INFO L87 Difference]: Start difference. First operand 27 states and 27 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) [2024-11-07 20:02:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:52,558 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-07 20:02:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:02:52,558 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 [2024-11-07 20:02:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:52,558 INFO L225 Difference]: With dead ends: 27 [2024-11-07 20:02:52,559 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 20:02:52,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2024-11-07 20:02:52,559 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:52,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2024-11-07 20:02:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 20:02:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 20:02:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-07 20:02:52,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2024-11-07 20:02:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:52,566 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-07 20:02:52,566 INFO L472 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) [2024-11-07 20:02:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-07 20:02:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 20:02:52,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:52,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:52,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 20:02:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:52,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-07 20:02:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1302301993, now seen corresponding path program 1 times [2024-11-07 20:02:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928535109] [2024-11-07 20:02:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928535109] [2024-11-07 20:02:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928535109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117917274] [2024-11-07 20:02:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:52,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:02:52,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 20:02:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:53,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-07 20:02:53,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:53,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 20:02:53,317 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_12 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_12 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_12 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_12)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_12 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-07 20:02:53,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:53,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:53,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-07 20:02:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:53,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:02:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117917274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:54,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:02:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 20 [2024-11-07 20:02:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279195532] [2024-11-07 20:02:54,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:02:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 20:02:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 20:02:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=491, Unknown=1, NotChecked=44, Total=600 [2024-11-07 20:02:54,210 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 20:02:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:54,549 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-07 20:02:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 20:02:54,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-07 20:02:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:54,551 INFO L225 Difference]: With dead ends: 41 [2024-11-07 20:02:54,551 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:02:54,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=725, Unknown=2, NotChecked=54, Total=870 [2024-11-07 20:02:54,553 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:54,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 91 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2024-11-07 20:02:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:02:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:02:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:02:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:02:54,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-07 20:02:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:54,555 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:02:54,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 20:02:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:02:54,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:02:54,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-07 20:02:54,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-07 20:02:54,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 20:02:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:54,761 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:54,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:02:54,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:02:54,864 WARN L156 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-07 20:02:54,868 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-07 20:02:54,868 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-07 20:02:54,869 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-07 20:02:54,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-07 20:02:54,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-07 20:02:54,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-07 20:02:54,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-07 20:02:54,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-07 20:02:54,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-07 20:02:54,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-07 20:02:54,875 WARN L156 FloydHoareUtils]: Requires clause for LDV_INIT_LIST_HEAD contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) Eliminated clause: true [2024-11-07 20:02:54,877 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 20:02:54,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-07 20:02:54,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-07 20:02:54,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-07 20:02:54,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD [2024-11-07 20:02:54,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:02:54 BoogieIcfgContainer [2024-11-07 20:02:54,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:02:54,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:02:54,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:02:54,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:02:54,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:49" (3/4) ... [2024-11-07 20:02:54,882 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:02:54,887 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-07 20:02:54,887 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-07 20:02:54,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-07 20:02:54,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-07 20:02:54,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 20:02:54,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:02:54,958 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:02:54,959 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:02:54,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:02:54,960 INFO L158 Benchmark]: Toolchain (without parser) took 6066.98ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 90.5MB in the beginning and 55.2MB in the end (delta: 35.4MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2024-11-07 20:02:54,960 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:02:54,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.72ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 69.1MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 20:02:54,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:02:54,960 INFO L158 Benchmark]: Boogie Preprocessor took 59.09ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:02:54,961 INFO L158 Benchmark]: RCFGBuilder took 404.94ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 47.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:02:54,961 INFO L158 Benchmark]: TraceAbstraction took 4945.83ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 46.4MB in the beginning and 61.7MB in the end (delta: -15.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-11-07 20:02:54,961 INFO L158 Benchmark]: Witness Printer took 79.40ms. Allocated memory is still 176.2MB. Free memory was 61.7MB in the beginning and 55.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:02:54,962 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.72ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 69.1MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.09ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.94ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 47.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4945.83ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 46.4MB in the beginning and 61.7MB in the end (delta: -15.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Witness Printer took 79.40ms. Allocated memory is still 176.2MB. Free memory was 61.7MB in the beginning and 55.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 831 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 68 IncrementalHoareTripleChecker+Unchecked, 655 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 176 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 185 ConstructedInterpolants, 4 QuantifiedInterpolants, 768 SizeOfPredicates, 14 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 525]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Ensures: (ldv_global_msg_list == \old(ldv_global_msg_list)) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:02:54,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE