./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.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-1.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', 'aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd'] 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-1.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 aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:02:45,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:02:45,268 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:45,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:02:45,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:02:45,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:02:45,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:02:45,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:02:45,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:02:45,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:02:45,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:02:45,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:02:45,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:02:45,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:02:45,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:02:45,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:02:45,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:02:45,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:02:45,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:02:45,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:02:45,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:02:45,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:02:45,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:02:45,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:02:45,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:02:45,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:02:45,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:02:45,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:02:45,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:02:45,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:02:45,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:02:45,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:02:45,303 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2024-11-07 20:02:45,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:02:45,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:02:45,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:02:45,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:02:45,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:02:45,610 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-1.i [2024-11-07 20:02:46,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:02:47,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:02:47,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-11-07 20:02:47,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f49120de/cfa2e979e0384d1ca7325c5c3f6faa1c/FLAG109560c74 [2024-11-07 20:02:47,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f49120de/cfa2e979e0384d1ca7325c5c3f6faa1c [2024-11-07 20:02:47,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:02:47,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:02:47,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:02:47,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:02:47,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:02:47,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:47" (1/1) ... [2024-11-07 20:02:47,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddd6ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:47, skipping insertion in model container [2024-11-07 20:02:47,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:47" (1/1) ... [2024-11-07 20:02:47,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:02:47,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:02:47,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:02:47,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:02:47,640 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:02:47,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:47 WrapperNode [2024-11-07 20:02:47,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:02:47,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:02:47,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:02:47,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:02:47,649 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:47" (1/1) ... [2024-11-07 20:02:47,670 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:47" (1/1) ... [2024-11-07 20:02:47,700 INFO L138 Inliner]: procedures = 164, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 123 [2024-11-07 20:02:47,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:02:47,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:02:47,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:02:47,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:02:47,710 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:47" (1/1) ... [2024-11-07 20:02:47,710 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:47" (1/1) ... [2024-11-07 20:02:47,717 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:47" (1/1) ... [2024-11-07 20:02:47,748 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-07 20:02:47,749 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:47" (1/1) ... [2024-11-07 20:02:47,749 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:47" (1/1) ... [2024-11-07 20:02:47,759 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:47" (1/1) ... [2024-11-07 20:02:47,762 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:47" (1/1) ... [2024-11-07 20:02:47,763 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:47" (1/1) ... [2024-11-07 20:02:47,764 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:47" (1/1) ... [2024-11-07 20:02:47,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:02:47,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:02:47,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:02:47,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:02:47,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:47" (1/1) ... [2024-11-07 20:02:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:02:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:47,800 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:47,803 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:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-07 20:02:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 20:02:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 20:02:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 20:02:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:02:47,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:02:47,940 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:02:47,942 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:02:48,195 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-07 20:02:48,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:02:48,204 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:02:48,204 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 20:02:48,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:48 BoogieIcfgContainer [2024-11-07 20:02:48,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:02:48,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:02:48,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:02:48,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:02:48,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:02:47" (1/3) ... [2024-11-07 20:02:48,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc0e7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:48, skipping insertion in model container [2024-11-07 20:02:48,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:47" (2/3) ... [2024-11-07 20:02:48,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc0e7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:48, skipping insertion in model container [2024-11-07 20:02:48,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:48" (3/3) ... [2024-11-07 20:02:48,217 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2024-11-07 20:02:48,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:02:48,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:02:48,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:02:48,291 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;@4392eadf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:02:48,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:02:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 44 states have internal predecessors, (52), 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:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:02:48,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:48,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:48,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1359866553, now seen corresponding path program 1 times [2024-11-07 20:02:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683910596] [2024-11-07 20:02:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:48,671 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:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683910596] [2024-11-07 20:02:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683910596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:02:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703321667] [2024-11-07 20:02:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:48,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:02:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:02:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:48,695 INFO L87 Difference]: Start difference. First operand has 48 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 44 states have internal predecessors, (52), 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:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:48,786 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-07 20:02:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:48,788 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:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:48,794 INFO L225 Difference]: With dead ends: 88 [2024-11-07 20:02:48,794 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 20:02:48,796 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:48,799 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 235 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:48,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 235 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:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 20:02:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-11-07 20:02:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 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:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-07 20:02:48,838 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2024-11-07 20:02:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-07 20:02:48,838 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:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-07 20:02:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:02:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:48,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:48,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:02:48,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 382943782, now seen corresponding path program 1 times [2024-11-07 20:02:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498426658] [2024-11-07 20:02:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,007 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:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498426658] [2024-11-07 20:02:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498426658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:02:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674329353] [2024-11-07 20:02:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:49,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:02:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:02:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:02:49,012 INFO L87 Difference]: Start difference. First operand 39 states and 44 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:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:49,064 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-07 20:02:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:02:49,067 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:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:49,068 INFO L225 Difference]: With dead ends: 55 [2024-11-07 20:02:49,068 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 20:02:49,068 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:49,069 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:49,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 20:02:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-07 20:02:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 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:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-07 20:02:49,077 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 12 [2024-11-07 20:02:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-07 20:02:49,078 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:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-07 20:02:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:02:49,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:49,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:49,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:02:49,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 854695960, now seen corresponding path program 1 times [2024-11-07 20:02:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250757808] [2024-11-07 20:02:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,225 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:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250757808] [2024-11-07 20:02:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250757808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:49,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:49,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:02:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139466377] [2024-11-07 20:02:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:02:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:02:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:49,229 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:49,279 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-07 20:02:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-07 20:02:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:49,281 INFO L225 Difference]: With dead ends: 48 [2024-11-07 20:02:49,281 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 20:02:49,282 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:49,282 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:49,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 20:02:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-07 20:02:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 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:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-07 20:02:49,288 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2024-11-07 20:02:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:49,288 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-07 20:02:49,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-07 20:02:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:02:49,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:49,290 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:49,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:02:49,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 762196724, now seen corresponding path program 1 times [2024-11-07 20:02:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26799835] [2024-11-07 20:02:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,416 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:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26799835] [2024-11-07 20:02:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26799835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:49,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:02:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893865571] [2024-11-07 20:02:49,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 20:02:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:49,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 20:02:49,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:02:49,419 INFO L87 Difference]: Start difference. First operand 35 states and 39 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:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:49,494 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-11-07 20:02:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:02:49,495 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:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:49,495 INFO L225 Difference]: With dead ends: 63 [2024-11-07 20:02:49,495 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 20:02:49,496 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:49,497 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:49,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 184 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:02:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 20:02:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-07 20:02:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 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:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-07 20:02:49,504 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 16 [2024-11-07 20:02:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:49,505 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-07 20:02:49,505 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:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-07 20:02:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:02:49,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:49,507 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:49,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:02:49,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 891279443, now seen corresponding path program 1 times [2024-11-07 20:02:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:49,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737547971] [2024-11-07 20:02:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,639 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:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737547971] [2024-11-07 20:02:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737547971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 20:02:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552403476] [2024-11-07 20:02:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:49,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:02:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:02:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:02:49,641 INFO L87 Difference]: Start difference. First operand 42 states and 47 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:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:49,691 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-07 20:02:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:49,692 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:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:49,692 INFO L225 Difference]: With dead ends: 65 [2024-11-07 20:02:49,692 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 20:02:49,693 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:49,694 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 162 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:49,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 162 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:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 20:02:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 20:02:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 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:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-11-07 20:02:49,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 16 [2024-11-07 20:02:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:49,700 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-11-07 20:02:49,700 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:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-07 20:02:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 20:02:49,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:49,701 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:49,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:02:49,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:49,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -484408867, now seen corresponding path program 1 times [2024-11-07 20:02:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747947500] [2024-11-07 20:02:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:49,813 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:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747947500] [2024-11-07 20:02:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747947500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:49,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 20:02:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448258677] [2024-11-07 20:02:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:02:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:49,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:02:49,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:02:49,816 INFO L87 Difference]: Start difference. First operand 35 states and 37 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:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:49,886 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-07 20:02:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:02:49,886 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:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:49,887 INFO L225 Difference]: With dead ends: 52 [2024-11-07 20:02:49,887 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 20:02:49,887 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:49,888 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:49,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:02:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 20:02:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 20:02:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 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:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-07 20:02:49,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 18 [2024-11-07 20:02:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-07 20:02:49,892 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:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-07 20:02:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 20:02:49,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:49,893 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:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:02:49,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash 526836662, now seen corresponding path program 1 times [2024-11-07 20:02:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504255247] [2024-11-07 20:02:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:02:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,045 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,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504255247] [2024-11-07 20:02:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504255247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:50,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:02:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414982805] [2024-11-07 20:02:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:50,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:02:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:02:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:02:50,048 INFO L87 Difference]: Start difference. First operand 35 states and 36 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:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:50,113 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2024-11-07 20:02:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:02:50,115 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:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:50,115 INFO L225 Difference]: With dead ends: 61 [2024-11-07 20:02:50,116 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 20:02:50,116 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:50,116 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:50,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:02:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 20:02:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 20:02:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 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,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-07 20:02:50,121 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2024-11-07 20:02:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:50,122 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-07 20:02:50,122 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:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-07 20:02:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 20:02:50,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:50,123 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:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:02:50,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:50,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -967584999, now seen corresponding path program 1 times [2024-11-07 20:02:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864816351] [2024-11-07 20:02:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,307 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:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864816351] [2024-11-07 20:02:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864816351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120319267] [2024-11-07 20:02:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:50,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:50,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:50,311 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:50,313 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:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:50,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-07 20:02:50,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:50,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 20:02:50,679 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:50,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:50,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:50,714 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:50,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 20:02:50,832 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:50,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:02:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120319267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:02:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-07 20:02:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022764358] [2024-11-07 20:02:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:02:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:02:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-07 20:02:50,837 INFO L87 Difference]: Start difference. First operand 36 states and 37 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:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,009 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-07 20:02:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:02:51,010 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:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,010 INFO L225 Difference]: With dead ends: 36 [2024-11-07 20:02:51,010 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 20:02:51,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2024-11-07 20:02:51,012 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2024-11-07 20:02:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 20:02:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 20:02:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 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,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-07 20:02:51,016 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 24 [2024-11-07 20:02:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-07 20:02:51,016 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:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-07 20:02:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 20:02:51,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,017 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:51,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 20:02:51,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:51,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash 69636185, now seen corresponding path program 1 times [2024-11-07 20:02:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213890349] [2024-11-07 20:02:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,386 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,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213890349] [2024-11-07 20:02:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213890349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911220160] [2024-11-07 20:02:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:51,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:51,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:51,390 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:51,392 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:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:51,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-07 20:02:51,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:51,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 20:02:51,650 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:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:51,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-07 20:02:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-07 20:02:51,757 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:51,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:02:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911220160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:02:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-07 20:02:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733485780] [2024-11-07 20:02:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:51,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 20:02:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 20:02:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-07 20:02:51,758 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:51,863 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-07 20:02:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:02:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-07 20:02:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:51,864 INFO L225 Difference]: With dead ends: 36 [2024-11-07 20:02:51,864 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 20:02:51,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=178, Unknown=1, NotChecked=26, Total=240 [2024-11-07 20:02:51,865 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:51,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2024-11-07 20:02:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 20:02:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-07 20:02:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-07 20:02:51,870 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2024-11-07 20:02:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:51,871 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-07 20:02:51,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:02:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-07 20:02:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 20:02:51,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:51,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:51,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 20:02:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:52,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1789557179, now seen corresponding path program 1 times [2024-11-07 20:02:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650223691] [2024-11-07 20:02:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,235 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,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650223691] [2024-11-07 20:02:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650223691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:02:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:02:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 20:02:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490167833] [2024-11-07 20:02:52,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:02:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 20:02:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 20:02:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:02:52,239 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 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:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:52,341 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-11-07 20:02:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 20:02:52,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 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) Word has length 27 [2024-11-07 20:02:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:52,342 INFO L225 Difference]: With dead ends: 41 [2024-11-07 20:02:52,342 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 20:02:52,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:02:52,343 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:52,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:02:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 20:02:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 20:02:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-07 20:02:52,350 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 27 [2024-11-07 20:02:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:52,350 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-11-07 20:02:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 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:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-07 20:02:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 20:02:52,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:52,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:52,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 20:02:52,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:52,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1229091263, now seen corresponding path program 1 times [2024-11-07 20:02:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:52,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169192934] [2024-11-07 20:02:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 20:02:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,574 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,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169192934] [2024-11-07 20:02:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169192934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708332080] [2024-11-07 20:02:52,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:52,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:52,577 INFO L229 MonitoredProcess]: Starting monitored process 4 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,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 20:02:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:52,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-07 20:02:52,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:52,843 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,904 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_18 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_18 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_18 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_18)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_18 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-07 20:02:52,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:52,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:52,930 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,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 20:02:53,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 20:02:53,189 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,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:02:57,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708332080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:57,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:02:57,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 22 [2024-11-07 20:02:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089595425] [2024-11-07 20:02:57,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:02:57,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 20:02:57,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:02:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 20:02:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=734, Unknown=2, NotChecked=54, Total=870 [2024-11-07 20:02:57,718 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 18 states have internal predecessors, (52), 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:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:02:58,169 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-11-07 20:02:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 20:02:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 18 states have internal predecessors, (52), 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 31 [2024-11-07 20:02:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:02:58,170 INFO L225 Difference]: With dead ends: 57 [2024-11-07 20:02:58,170 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 20:02:58,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=112, Invalid=1079, Unknown=3, NotChecked=66, Total=1260 [2024-11-07 20:02:58,171 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:02:58,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2024-11-07 20:02:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 20:02:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 20:02:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-07 20:02:58,177 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2024-11-07 20:02:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:02:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-11-07 20:02:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 18 states have internal predecessors, (52), 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:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-07 20:02:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 20:02:58,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:02:58,178 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:02:58,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 20:02:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:58,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:02:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:02:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1252161153, now seen corresponding path program 1 times [2024-11-07 20:02:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:02:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023026041] [2024-11-07 20:02:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:02:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:02:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 20:02:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:02:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023026041] [2024-11-07 20:02:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023026041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:02:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414573776] [2024-11-07 20:02:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:02:58,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:02:58,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:02:58,584 INFO L229 MonitoredProcess]: Starting monitored process 5 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:58,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 20:02:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:02:58,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-07 20:02:58,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:02:58,881 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:58,966 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_25 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_25 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_25 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_25 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_25)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#1|))) is different from true [2024-11-07 20:02:58,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:58,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 20:02:58,991 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:59,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 20:02:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 20:02:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:02:59,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:03:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414573776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:03:03,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:03:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 24 [2024-11-07 20:03:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947141293] [2024-11-07 20:03:03,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:03:03,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 20:03:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:03:03,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 20:03:03,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=840, Unknown=2, NotChecked=58, Total=992 [2024-11-07 20:03:03,663 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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:03:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:03:04,041 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2024-11-07 20:03:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 20:03:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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 33 [2024-11-07 20:03:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:03:04,041 INFO L225 Difference]: With dead ends: 56 [2024-11-07 20:03:04,041 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:03:04,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=120, Invalid=1141, Unknown=3, NotChecked=68, Total=1332 [2024-11-07 20:03:04,043 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:03:04,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2024-11-07 20:03:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:03:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:03:04,043 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:03:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:03:04,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2024-11-07 20:03:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:03:04,044 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:03:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 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:03:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:03:04,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:03:04,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 20:03:04,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 20:03:04,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 20:03:04,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 20:03:04,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:03:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 20:03:04,256 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:03:04,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:03:04,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:03:04,358 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:03:04,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-07 20:03:04,362 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-07 20:03:04,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-07 20:03:04,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-07 20:03:04,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-07 20:03:04,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-07 20:03:04,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-07 20:03:04,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-07 20:03:04,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-07 20:03:04,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-07 20:03:04,368 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:03:04,371 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 20:03:04,371 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-07 20:03:04,371 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-07 20:03:04,371 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-07 20:03:04,372 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:03:04,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:03:04 BoogieIcfgContainer [2024-11-07 20:03:04,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:03:04,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:03:04,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:03:04,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:03:04,374 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:48" (3/4) ... [2024-11-07 20:03:04,376 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:03:04,381 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-07 20:03:04,381 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-07 20:03:04,387 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-11-07 20:03:04,388 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 20:03:04,388 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 20:03:04,388 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:03:04,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:03:04,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:03:04,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:03:04,468 INFO L158 Benchmark]: Toolchain (without parser) took 17320.72ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 75.5MB in the beginning and 32.2MB in the end (delta: 43.3MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-07 20:03:04,468 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:03:04,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.22ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 54.0MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 20:03:04,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.32ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 51.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:03:04,469 INFO L158 Benchmark]: Boogie Preprocessor took 64.00ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:03:04,470 INFO L158 Benchmark]: RCFGBuilder took 438.26ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 66.6MB in the end (delta: -18.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-07 20:03:04,471 INFO L158 Benchmark]: TraceAbstraction took 16164.23ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 65.7MB in the beginning and 37.8MB in the end (delta: 27.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-07 20:03:04,471 INFO L158 Benchmark]: Witness Printer took 93.40ms. Allocated memory is still 125.8MB. Free memory was 37.8MB in the beginning and 32.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:03:04,472 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.22ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 54.0MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.32ms. Allocated memory is still 100.7MB. Free memory was 54.0MB in the beginning and 51.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.00ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 438.26ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 66.6MB in the end (delta: -18.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16164.23ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 65.7MB in the beginning and 37.8MB in the end (delta: 27.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * Witness Printer took 93.40ms. Allocated memory is still 125.8MB. Free memory was 37.8MB in the beginning and 32.2MB in the end (delta: 5.6MB). 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: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1788 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 167 IncrementalHoareTripleChecker+Unchecked, 1454 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 334 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 349 ConstructedInterpolants, 8 QuantifiedInterpolants, 1655 SizeOfPredicates, 39 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: -1]: 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:03:04,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE