./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:52:49,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:52:50,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:52:50,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:52:50,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:52:50,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:52:50,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:52:50,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:52:50,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:52:50,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:52:50,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:52:50,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:52:50,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:52:50,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:52:50,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:52:50,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:52:50,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:52:50,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:52:50,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:52:50,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:52:50,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:52:50,070 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/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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2025-03-04 14:52:50,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:52:50,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:52:50,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:52:50,260 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:52:50,260 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:52:50,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-04 14:52:51,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a660fcc66/a5e83098018f4a39941b26f6e43d5b16/FLAG2f086d619 [2025-03-04 14:52:51,705 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:52:51,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-04 14:52:51,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a660fcc66/a5e83098018f4a39941b26f6e43d5b16/FLAG2f086d619 [2025-03-04 14:52:51,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a660fcc66/a5e83098018f4a39941b26f6e43d5b16 [2025-03-04 14:52:51,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:52:51,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:52:51,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:52:51,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:52:51,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:52:51,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:51" (1/1) ... [2025-03-04 14:52:51,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505924de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:51, skipping insertion in model container [2025-03-04 14:52:51,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:51" (1/1) ... [2025-03-04 14:52:52,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:52:52,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:52:52,519 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:52:52,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:52:52,650 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:52:52,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52 WrapperNode [2025-03-04 14:52:52,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:52:52,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:52:52,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:52:52,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:52:52,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,712 INFO L138 Inliner]: procedures = 282, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2025-03-04 14:52:52,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:52:52,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:52:52,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:52:52,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:52:52,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,790 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2025-03-04 14:52:52,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:52:52,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:52:52,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:52:52,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:52:52,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (1/1) ... [2025-03-04 14:52:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:52:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:52:52,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:52:52,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:52:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:52:52,928 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:52:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-04 14:52:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-04 14:52:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:52:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:52:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:52:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:52:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:52:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-04 14:52:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:52:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-04 14:52:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-04 14:52:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:52:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:52:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:52:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:52:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:52:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:52:53,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:52:53,119 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:52:53,167 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-04 14:52:54,130 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-04 14:52:54,131 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-04 14:52:54,131 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 14:52:54,187 INFO L? ?]: Removed 345 outVars from TransFormulas that were not future-live. [2025-03-04 14:52:54,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:52:54,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:52:54,247 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:52:54,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:54 BoogieIcfgContainer [2025-03-04 14:52:54,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:52:54,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:52:54,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:52:54,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:52:54,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:52:51" (1/3) ... [2025-03-04 14:52:54,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d623069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:54, skipping insertion in model container [2025-03-04 14:52:54,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:52" (2/3) ... [2025-03-04 14:52:54,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d623069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:54, skipping insertion in model container [2025-03-04 14:52:54,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:54" (3/3) ... [2025-03-04 14:52:54,255 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2025-03-04 14:52:54,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:52:54,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test6-1.i that has 6 procedures, 457 locations, 1 initial locations, 34 loop locations, and 14 error locations. [2025-03-04 14:52:54,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:52:54,333 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;@2b84d4d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:52:54,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 14:52:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 420 states have (on average 1.6023809523809525) internal successors, (673), 437 states have internal predecessors, (673), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:52:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:52:54,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:54,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:54,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:54,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:54,346 INFO L85 PathProgramCache]: Analyzing trace with hash -945499652, now seen corresponding path program 1 times [2025-03-04 14:52:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906601240] [2025-03-04 14:52:54,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:52:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:52:54,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:54,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906601240] [2025-03-04 14:52:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906601240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:52:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212677873] [2025-03-04 14:52:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:54,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:52:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:52:54,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:52:54,503 INFO L87 Difference]: Start difference. First operand has 457 states, 420 states have (on average 1.6023809523809525) internal successors, (673), 437 states have internal predecessors, (673), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-03-04 14:52:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:54,621 INFO L93 Difference]: Finished difference Result 907 states and 1421 transitions. [2025-03-04 14:52:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:52:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 14:52:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:54,631 INFO L225 Difference]: With dead ends: 907 [2025-03-04 14:52:54,631 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 14:52:54,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:52:54,639 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:54,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 14:52:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-04 14:52:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 410 states have (on average 1.4536585365853658) internal successors, (596), 424 states have internal predecessors, (596), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:52:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 616 transitions. [2025-03-04 14:52:54,687 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 616 transitions. Word has length 8 [2025-03-04 14:52:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:54,688 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 616 transitions. [2025-03-04 14:52:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-03-04 14:52:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 616 transitions. [2025-03-04 14:52:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:52:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:54,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:52:54,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:54,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -945498691, now seen corresponding path program 1 times [2025-03-04 14:52:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420741078] [2025-03-04 14:52:54,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:52:54,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:52:54,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:54,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:52:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628480497] [2025-03-04 14:52:54,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:54,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:52:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:52:54,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:52:54,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:52:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:52:54,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:52:54,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:54,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:54,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:52:54,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:52:54,901 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 [2025-03-04 14:52:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:54,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:52:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:54,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420741078] [2025-03-04 14:52:54,932 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:52:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628480497] [2025-03-04 14:52:54,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628480497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:54,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:54,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:52:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896217465] [2025-03-04 14:52:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:52:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:52:54,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:52:54,934 INFO L87 Difference]: Start difference. First operand 438 states and 616 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-04 14:52:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:55,159 INFO L93 Difference]: Finished difference Result 842 states and 1199 transitions. [2025-03-04 14:52:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:52:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 14:52:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:55,163 INFO L225 Difference]: With dead ends: 842 [2025-03-04 14:52:55,163 INFO L226 Difference]: Without dead ends: 840 [2025-03-04 14:52:55,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:52:55,164 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 557 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1724 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:52:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-04 14:52:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 445. [2025-03-04 14:52:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 417 states have (on average 1.4484412470023982) internal successors, (604), 431 states have internal predecessors, (604), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:52:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 624 transitions. [2025-03-04 14:52:55,194 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 624 transitions. Word has length 8 [2025-03-04 14:52:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:55,194 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 624 transitions. [2025-03-04 14:52:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-04 14:52:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 624 transitions. [2025-03-04 14:52:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:52:55,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:55,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2025-03-04 14:52:55,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:52:55,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:52:55,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1620078048, now seen corresponding path program 1 times [2025-03-04 14:52:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119656227] [2025-03-04 14:52:55,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:55,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:52:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:52:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119656227] [2025-03-04 14:52:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119656227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:52:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162646257] [2025-03-04 14:52:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:55,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:52:55,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:55,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:52:55,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:52:55,702 INFO L87 Difference]: Start difference. First operand 445 states and 624 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:52:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:55,845 INFO L93 Difference]: Finished difference Result 839 states and 1172 transitions. [2025-03-04 14:52:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:52:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 14:52:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:55,847 INFO L225 Difference]: With dead ends: 839 [2025-03-04 14:52:55,848 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 14:52:55,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:52:55,849 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 30 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:55,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1427 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 14:52:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 14:52:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 375 states have (on average 1.4053333333333333) internal successors, (527), 389 states have internal predecessors, (527), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:52:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 547 transitions. [2025-03-04 14:52:55,866 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 547 transitions. Word has length 62 [2025-03-04 14:52:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 547 transitions. [2025-03-04 14:52:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:52:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 547 transitions. [2025-03-04 14:52:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:52:55,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:55,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2025-03-04 14:52:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:52:55,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1726730970, now seen corresponding path program 1 times [2025-03-04 14:52:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74542310] [2025-03-04 14:52:55,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:55,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:52:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:52:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74542310] [2025-03-04 14:52:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74542310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:52:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486013546] [2025-03-04 14:52:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:52:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:56,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:52:56,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:52:56,119 INFO L87 Difference]: Start difference. First operand 403 states and 547 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:52:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:56,248 INFO L93 Difference]: Finished difference Result 727 states and 997 transitions. [2025-03-04 14:52:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:52:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 14:52:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:56,255 INFO L225 Difference]: With dead ends: 727 [2025-03-04 14:52:56,255 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 14:52:56,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:52:56,258 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 378 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:56,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1478 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 14:52:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 715. [2025-03-04 14:52:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 684 states have (on average 1.4137426900584795) internal successors, (967), 699 states have internal predecessors, (967), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:52:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 993 transitions. [2025-03-04 14:52:56,284 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 993 transitions. Word has length 62 [2025-03-04 14:52:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 993 transitions. [2025-03-04 14:52:56,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:52:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 993 transitions. [2025-03-04 14:52:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 14:52:56,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:56,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:56,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:52:56,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2053430496, now seen corresponding path program 1 times [2025-03-04 14:52:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510319856] [2025-03-04 14:52:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:56,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 14:52:56,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 14:52:56,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:56,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510319856] [2025-03-04 14:52:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510319856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:52:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979985906] [2025-03-04 14:52:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:52:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:52:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:52:56,511 INFO L87 Difference]: Start difference. First operand 715 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2025-03-04 14:52:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:56,680 INFO L93 Difference]: Finished difference Result 1675 states and 2370 transitions. [2025-03-04 14:52:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:52:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) Word has length 68 [2025-03-04 14:52:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:56,686 INFO L225 Difference]: With dead ends: 1675 [2025-03-04 14:52:56,686 INFO L226 Difference]: Without dead ends: 1279 [2025-03-04 14:52:56,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:52:56,687 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 476 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:56,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1440 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-03-04 14:52:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 715. [2025-03-04 14:52:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 684 states have (on average 1.412280701754386) internal successors, (966), 699 states have internal predecessors, (966), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:52:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 992 transitions. [2025-03-04 14:52:56,723 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 992 transitions. Word has length 68 [2025-03-04 14:52:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:56,723 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 992 transitions. [2025-03-04 14:52:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2025-03-04 14:52:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 992 transitions. [2025-03-04 14:52:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 14:52:56,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:56,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:52:56,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 385671518, now seen corresponding path program 1 times [2025-03-04 14:52:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478404815] [2025-03-04 14:52:56,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:56,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:52:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:52:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478404815] [2025-03-04 14:52:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478404815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:56,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:52:56,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:52:56,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557554147] [2025-03-04 14:52:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:56,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:52:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:56,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:52:56,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:52:56,866 INFO L87 Difference]: Start difference. First operand 715 states and 992 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:52:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:56,955 INFO L93 Difference]: Finished difference Result 943 states and 1304 transitions. [2025-03-04 14:52:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:52:56,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-03-04 14:52:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:56,959 INFO L225 Difference]: With dead ends: 943 [2025-03-04 14:52:56,959 INFO L226 Difference]: Without dead ends: 941 [2025-03-04 14:52:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:52:56,960 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 404 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 992 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-04 14:52:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 931. [2025-03-04 14:52:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 892 states have (on average 1.4192825112107623) internal successors, (1266), 908 states have internal predecessors, (1266), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:52:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1302 transitions. [2025-03-04 14:52:56,985 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1302 transitions. Word has length 72 [2025-03-04 14:52:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:56,986 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1302 transitions. [2025-03-04 14:52:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:52:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1302 transitions. [2025-03-04 14:52:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 14:52:56,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:56,987 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:56,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:52:56,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash -679971364, now seen corresponding path program 1 times [2025-03-04 14:52:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151042240] [2025-03-04 14:52:56,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:57,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:52:57,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:52:57,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:57,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151042240] [2025-03-04 14:52:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151042240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:52:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895832843] [2025-03-04 14:52:57,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:57,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:52:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:52:57,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:52:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:52:57,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:52:57,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:52:57,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:57,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:57,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:52:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:52:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:57,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:52:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895832843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:52:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:52:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-04 14:52:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108716778] [2025-03-04 14:52:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:52:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:52:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:57,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:52:57,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:52:57,527 INFO L87 Difference]: Start difference. First operand 931 states and 1302 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:52:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:57,682 INFO L93 Difference]: Finished difference Result 1253 states and 1750 transitions. [2025-03-04 14:52:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:52:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2025-03-04 14:52:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:57,688 INFO L225 Difference]: With dead ends: 1253 [2025-03-04 14:52:57,688 INFO L226 Difference]: Without dead ends: 1252 [2025-03-04 14:52:57,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:52:57,690 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 498 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:57,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1892 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:52:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-04 14:52:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1050. [2025-03-04 14:52:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1009 states have (on average 1.4122893954410307) internal successors, (1425), 1026 states have internal predecessors, (1425), 20 states have call successors, (20), 10 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:52:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1465 transitions. [2025-03-04 14:52:57,721 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1465 transitions. Word has length 81 [2025-03-04 14:52:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1465 transitions. [2025-03-04 14:52:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:52:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1465 transitions. [2025-03-04 14:52:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 14:52:57,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:57,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:57,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:52:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 14:52:57,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:57,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash 395724174, now seen corresponding path program 1 times [2025-03-04 14:52:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030510432] [2025-03-04 14:52:57,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 14:52:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 14:52:57,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:52:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030510432] [2025-03-04 14:52:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030510432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:52:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652720144] [2025-03-04 14:52:58,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:52:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:52:58,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:52:58,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:52:58,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 14:52:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 14:52:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:52:58,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 14:52:58,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:52:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:58,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:52:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:52:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652720144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:52:58,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:52:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-04 14:52:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800060747] [2025-03-04 14:52:58,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:52:58,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 14:52:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:52:58,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 14:52:58,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 14:52:58,642 INFO L87 Difference]: Start difference. First operand 1050 states and 1465 transitions. Second operand has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:52:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:52:59,685 INFO L93 Difference]: Finished difference Result 2823 states and 3921 transitions. [2025-03-04 14:52:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 14:52:59,686 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 82 [2025-03-04 14:52:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:52:59,696 INFO L225 Difference]: With dead ends: 2823 [2025-03-04 14:52:59,696 INFO L226 Difference]: Without dead ends: 2821 [2025-03-04 14:52:59,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 14:52:59,698 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 4024 mSDsluCounter, 6824 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4034 SdHoareTripleChecker+Valid, 7376 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:52:59,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4034 Valid, 7376 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 14:52:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-03-04 14:52:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2338. [2025-03-04 14:52:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2250 states have (on average 1.3946666666666667) internal successors, (3138), 2269 states have internal predecessors, (3138), 56 states have call successors, (56), 23 states have call predecessors, (56), 18 states have return successors, (79), 45 states have call predecessors, (79), 56 states have call successors, (79) [2025-03-04 14:52:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3273 transitions. [2025-03-04 14:52:59,756 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3273 transitions. Word has length 82 [2025-03-04 14:52:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:52:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3273 transitions. [2025-03-04 14:52:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:52:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3273 transitions. [2025-03-04 14:52:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 14:52:59,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:52:59,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:52:59,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:52:59,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:52:59,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:52:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:52:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 734834845, now seen corresponding path program 1 times [2025-03-04 14:52:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:52:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168080396] [2025-03-04 14:52:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:52:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:52:59,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 14:52:59,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 14:52:59,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:52:59,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:53:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168080396] [2025-03-04 14:53:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168080396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:00,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:00,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673595273] [2025-03-04 14:53:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:00,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:53:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:00,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:53:00,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:53:00,042 INFO L87 Difference]: Start difference. First operand 2338 states and 3273 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-04 14:53:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:00,203 INFO L93 Difference]: Finished difference Result 4733 states and 6646 transitions. [2025-03-04 14:53:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:53:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) Word has length 80 [2025-03-04 14:53:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:00,210 INFO L225 Difference]: With dead ends: 4733 [2025-03-04 14:53:00,210 INFO L226 Difference]: Without dead ends: 2404 [2025-03-04 14:53:00,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:53:00,214 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 296 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:00,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1139 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-04 14:53:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2393. [2025-03-04 14:53:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2312 states have (on average 1.4031141868512111) internal successors, (3244), 2330 states have internal predecessors, (3244), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-04 14:53:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3366 transitions. [2025-03-04 14:53:00,293 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3366 transitions. Word has length 80 [2025-03-04 14:53:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3366 transitions. [2025-03-04 14:53:00,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-04 14:53:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3366 transitions. [2025-03-04 14:53:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 14:53:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:00,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:00,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:53:00,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:00,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:00,295 INFO L85 PathProgramCache]: Analyzing trace with hash 151452928, now seen corresponding path program 1 times [2025-03-04 14:53:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:00,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066459319] [2025-03-04 14:53:00,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:00,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 14:53:00,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 14:53:00,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:00,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066459319] [2025-03-04 14:53:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066459319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774464559] [2025-03-04 14:53:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:00,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:00,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:00,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:53:00,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 14:53:00,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 14:53:00,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:00,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:00,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:53:00,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:53:00,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774464559] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:53:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 12 [2025-03-04 14:53:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798858654] [2025-03-04 14:53:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:00,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:53:00,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:00,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:53:00,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:00,966 INFO L87 Difference]: Start difference. First operand 2393 states and 3366 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:53:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:01,061 INFO L93 Difference]: Finished difference Result 2393 states and 3366 transitions. [2025-03-04 14:53:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:53:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 91 [2025-03-04 14:53:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:01,069 INFO L225 Difference]: With dead ends: 2393 [2025-03-04 14:53:01,069 INFO L226 Difference]: Without dead ends: 2392 [2025-03-04 14:53:01,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:01,070 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:01,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 496 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-04 14:53:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2025-03-04 14:53:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2312 states have (on average 1.4009515570934257) internal successors, (3239), 2329 states have internal predecessors, (3239), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-04 14:53:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3361 transitions. [2025-03-04 14:53:01,140 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3361 transitions. Word has length 91 [2025-03-04 14:53:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:01,141 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3361 transitions. [2025-03-04 14:53:01,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:53:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3361 transitions. [2025-03-04 14:53:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 14:53:01,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:01,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:01,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:01,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:01,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 400073469, now seen corresponding path program 1 times [2025-03-04 14:53:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139834327] [2025-03-04 14:53:01,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:01,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:53:01,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:53:01,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:01,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139834327] [2025-03-04 14:53:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139834327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916394438] [2025-03-04 14:53:01,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:01,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:01,570 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:01,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:53:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:53:01,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:53:01,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:01,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:01,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:53:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:53:01,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916394438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:02,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-04 14:53:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401475378] [2025-03-04 14:53:02,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:53:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:53:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:02,025 INFO L87 Difference]: Start difference. First operand 2392 states and 3361 transitions. Second operand has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 14:53:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:02,571 INFO L93 Difference]: Finished difference Result 4749 states and 6675 transitions. [2025-03-04 14:53:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 14:53:02,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 92 [2025-03-04 14:53:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:02,586 INFO L225 Difference]: With dead ends: 4749 [2025-03-04 14:53:02,587 INFO L226 Difference]: Without dead ends: 4748 [2025-03-04 14:53:02,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:53:02,589 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1668 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:02,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 3457 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:53:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-03-04 14:53:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4369. [2025-03-04 14:53:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 4213 states have (on average 1.3999525278898648) internal successors, (5898), 4233 states have internal predecessors, (5898), 99 states have call successors, (99), 50 states have call predecessors, (99), 44 states have return successors, (137), 85 states have call predecessors, (137), 99 states have call successors, (137) [2025-03-04 14:53:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6134 transitions. [2025-03-04 14:53:02,718 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6134 transitions. Word has length 92 [2025-03-04 14:53:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:02,718 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6134 transitions. [2025-03-04 14:53:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 14:53:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6134 transitions. [2025-03-04 14:53:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 14:53:02,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:02,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:02,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 14:53:02,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1897149704, now seen corresponding path program 1 times [2025-03-04 14:53:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135390248] [2025-03-04 14:53:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 14:53:02,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 14:53:02,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:02,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 14:53:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:03,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135390248] [2025-03-04 14:53:03,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135390248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:03,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:03,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329660246] [2025-03-04 14:53:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:03,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:03,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:03,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:03,126 INFO L87 Difference]: Start difference. First operand 4369 states and 6134 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:53:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:03,334 INFO L93 Difference]: Finished difference Result 5891 states and 8329 transitions. [2025-03-04 14:53:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 118 [2025-03-04 14:53:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:03,352 INFO L225 Difference]: With dead ends: 5891 [2025-03-04 14:53:03,352 INFO L226 Difference]: Without dead ends: 5889 [2025-03-04 14:53:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:53:03,355 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 390 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:03,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1418 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5889 states. [2025-03-04 14:53:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5889 to 4535. [2025-03-04 14:53:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4370 states have (on average 1.3945080091533182) internal successors, (6094), 4391 states have internal predecessors, (6094), 108 states have call successors, (108), 50 states have call predecessors, (108), 44 states have return successors, (149), 93 states have call predecessors, (149), 108 states have call successors, (149) [2025-03-04 14:53:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6351 transitions. [2025-03-04 14:53:03,481 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6351 transitions. Word has length 118 [2025-03-04 14:53:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6351 transitions. [2025-03-04 14:53:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:53:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6351 transitions. [2025-03-04 14:53:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 14:53:03,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:03,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:53:03,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 783839923, now seen corresponding path program 1 times [2025-03-04 14:53:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267375760] [2025-03-04 14:53:03,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:03,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 14:53:03,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 14:53:03,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:03,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267375760] [2025-03-04 14:53:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267375760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364932332] [2025-03-04 14:53:03,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:03,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:03,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:03,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:03,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:53:03,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 14:53:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 14:53:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:03,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 14:53:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 14:53:04,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364932332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-04 14:53:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20366576] [2025-03-04 14:53:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:04,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:04,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:04,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:04,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:04,082 INFO L87 Difference]: Start difference. First operand 4535 states and 6351 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:04,372 INFO L93 Difference]: Finished difference Result 8548 states and 12022 transitions. [2025-03-04 14:53:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:53:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2025-03-04 14:53:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:04,385 INFO L225 Difference]: With dead ends: 8548 [2025-03-04 14:53:04,385 INFO L226 Difference]: Without dead ends: 4329 [2025-03-04 14:53:04,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:04,391 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 85 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:04,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2780 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2025-03-04 14:53:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 4329. [2025-03-04 14:53:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4329 states, 4181 states have (on average 1.3996651518775411) internal successors, (5852), 4200 states have internal predecessors, (5852), 97 states have call successors, (97), 44 states have call predecessors, (97), 38 states have return successors, (132), 84 states have call predecessors, (132), 97 states have call successors, (132) [2025-03-04 14:53:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 6081 transitions. [2025-03-04 14:53:04,487 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 6081 transitions. Word has length 125 [2025-03-04 14:53:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 4329 states and 6081 transitions. [2025-03-04 14:53:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 6081 transitions. [2025-03-04 14:53:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 14:53:04,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:04,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:04,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:53:04,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:04,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 432839929, now seen corresponding path program 1 times [2025-03-04 14:53:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809705501] [2025-03-04 14:53:04,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:04,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 14:53:04,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 14:53:04,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:04,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 14:53:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809705501] [2025-03-04 14:53:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809705501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663975101] [2025-03-04 14:53:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:05,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:05,003 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:05,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:53:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 14:53:05,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 14:53:05,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:05,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 14:53:05,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:53:05,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:05,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663975101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:05,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:05,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 11 [2025-03-04 14:53:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930443524] [2025-03-04 14:53:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:53:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:05,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:53:05,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:53:05,422 INFO L87 Difference]: Start difference. First operand 4329 states and 6081 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 14:53:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:05,700 INFO L93 Difference]: Finished difference Result 6945 states and 9752 transitions. [2025-03-04 14:53:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:53:05,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 130 [2025-03-04 14:53:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:05,711 INFO L225 Difference]: With dead ends: 6945 [2025-03-04 14:53:05,711 INFO L226 Difference]: Without dead ends: 2699 [2025-03-04 14:53:05,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:05,718 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 13 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3888 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:05,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3888 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2025-03-04 14:53:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2025-03-04 14:53:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2595 states have (on average 1.3992292870905587) internal successors, (3631), 2611 states have internal predecessors, (3631), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (65), 47 states have call predecessors, (65), 54 states have call successors, (65) [2025-03-04 14:53:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3750 transitions. [2025-03-04 14:53:05,781 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3750 transitions. Word has length 130 [2025-03-04 14:53:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:05,781 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3750 transitions. [2025-03-04 14:53:05,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 14:53:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3750 transitions. [2025-03-04 14:53:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 14:53:05,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:05,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:05,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:53:05,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:05,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 230720251, now seen corresponding path program 1 times [2025-03-04 14:53:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:05,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-04 14:53:05,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:06,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 14:53:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 14:53:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:53:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-04 14:53:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673951331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868501569] [2025-03-04 14:53:06,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:06,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:06,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:53:06,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 14:53:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 14:53:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:06,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 14:53:06,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:06,660 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 [2025-03-04 14:53:06,677 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 [2025-03-04 14:53:06,693 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 22 [2025-03-04 14:53:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 14:53:07,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868501569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 14:53:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964807285] [2025-03-04 14:53:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:07,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:53:07,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:07,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:53:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 14:53:07,171 INFO L87 Difference]: Start difference. First operand 2697 states and 3750 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:08,102 INFO L93 Difference]: Finished difference Result 6267 states and 8774 transitions. [2025-03-04 14:53:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:53:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 132 [2025-03-04 14:53:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:08,110 INFO L225 Difference]: With dead ends: 6267 [2025-03-04 14:53:08,110 INFO L226 Difference]: Without dead ends: 3615 [2025-03-04 14:53:08,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-03-04 14:53:08,116 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 600 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:08,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2581 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:53:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-03-04 14:53:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2697. [2025-03-04 14:53:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2595 states have (on average 1.3988439306358382) internal successors, (3630), 2611 states have internal predecessors, (3630), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (65), 47 states have call predecessors, (65), 54 states have call successors, (65) [2025-03-04 14:53:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3749 transitions. [2025-03-04 14:53:08,168 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3749 transitions. Word has length 132 [2025-03-04 14:53:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:08,169 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3749 transitions. [2025-03-04 14:53:08,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3749 transitions. [2025-03-04 14:53:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 14:53:08,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:08,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:08,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:53:08,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1063136397, now seen corresponding path program 1 times [2025-03-04 14:53:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990755323] [2025-03-04 14:53:08,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 14:53:08,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 14:53:08,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:08,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:53:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990755323] [2025-03-04 14:53:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990755323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995580358] [2025-03-04 14:53:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:08,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:08,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:08,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:08,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:53:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 14:53:09,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 14:53:09,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:09,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:09,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 14:53:09,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:53:09,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:53:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995580358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:09,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 17 [2025-03-04 14:53:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659121988] [2025-03-04 14:53:09,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:09,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 14:53:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:09,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 14:53:09,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 14:53:09,261 INFO L87 Difference]: Start difference. First operand 2697 states and 3749 transitions. Second operand has 17 states, 17 states have (on average 8.941176470588236) internal successors, (152), 17 states have internal predecessors, (152), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:09,638 INFO L93 Difference]: Finished difference Result 5364 states and 7477 transitions. [2025-03-04 14:53:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 14:53:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.941176470588236) internal successors, (152), 17 states have internal predecessors, (152), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2025-03-04 14:53:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:09,645 INFO L225 Difference]: With dead ends: 5364 [2025-03-04 14:53:09,645 INFO L226 Difference]: Without dead ends: 2759 [2025-03-04 14:53:09,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:53:09,650 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 21 mSDsluCounter, 4868 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5358 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:09,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5358 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2025-03-04 14:53:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2737. [2025-03-04 14:53:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2634 states have (on average 1.3990129081245255) internal successors, (3685), 2647 states have internal predecessors, (3685), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3800 transitions. [2025-03-04 14:53:09,721 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3800 transitions. Word has length 133 [2025-03-04 14:53:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:09,721 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 3800 transitions. [2025-03-04 14:53:09,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.941176470588236) internal successors, (152), 17 states have internal predecessors, (152), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3800 transitions. [2025-03-04 14:53:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 14:53:09,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:09,723 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:09,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:09,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 14:53:09,925 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 485171243, now seen corresponding path program 2 times [2025-03-04 14:53:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069011279] [2025-03-04 14:53:09,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:09,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-04 14:53:10,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 14:53:10,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:10,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:53:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069011279] [2025-03-04 14:53:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069011279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332622591] [2025-03-04 14:53:10,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:10,339 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:53:10,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-04 14:53:10,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 137 statements. [2025-03-04 14:53:10,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:53:10,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:10,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:53:10,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:10,594 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 [2025-03-04 14:53:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 14:53:10,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332622591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 14:53:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594115628] [2025-03-04 14:53:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:53:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:10,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:53:10,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:10,629 INFO L87 Difference]: Start difference. First operand 2737 states and 3800 transitions. Second operand has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:10,704 INFO L93 Difference]: Finished difference Result 2737 states and 3800 transitions. [2025-03-04 14:53:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:53:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 137 [2025-03-04 14:53:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:10,711 INFO L225 Difference]: With dead ends: 2737 [2025-03-04 14:53:10,711 INFO L226 Difference]: Without dead ends: 2736 [2025-03-04 14:53:10,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:10,712 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 1 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:10,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 988 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:53:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-04 14:53:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2736. [2025-03-04 14:53:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2634 states have (on average 1.3967350037965072) internal successors, (3679), 2646 states have internal predecessors, (3679), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3794 transitions. [2025-03-04 14:53:10,764 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3794 transitions. Word has length 137 [2025-03-04 14:53:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:10,764 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 3794 transitions. [2025-03-04 14:53:10,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3794 transitions. [2025-03-04 14:53:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 14:53:10,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:10,765 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:10,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:10,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:53:10,965 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2139559961, now seen corresponding path program 1 times [2025-03-04 14:53:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818289342] [2025-03-04 14:53:10,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:10,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 14:53:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 14:53:11,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:11,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:53:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818289342] [2025-03-04 14:53:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818289342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572511186] [2025-03-04 14:53:11,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:11,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:11,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:11,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:11,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:53:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 14:53:11,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 14:53:11,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:11,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:11,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 14:53:11,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 14:53:11,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:53:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572511186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:12,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 27 [2025-03-04 14:53:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640309679] [2025-03-04 14:53:12,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:12,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 14:53:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 14:53:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-04 14:53:12,225 INFO L87 Difference]: Start difference. First operand 2736 states and 3794 transitions. Second operand has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:13,071 INFO L93 Difference]: Finished difference Result 5471 states and 7619 transitions. [2025-03-04 14:53:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 14:53:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2025-03-04 14:53:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:13,078 INFO L225 Difference]: With dead ends: 5471 [2025-03-04 14:53:13,078 INFO L226 Difference]: Without dead ends: 2812 [2025-03-04 14:53:13,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 14:53:13,082 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 56 mSDsluCounter, 6164 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6642 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:13,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6642 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:53:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-04 14:53:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2781. [2025-03-04 14:53:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2679 states have (on average 1.391190742814483) internal successors, (3727), 2691 states have internal predecessors, (3727), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3842 transitions. [2025-03-04 14:53:13,138 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3842 transitions. Word has length 138 [2025-03-04 14:53:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3842 transitions. [2025-03-04 14:53:13,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3842 transitions. [2025-03-04 14:53:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:53:13,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:13,139 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:13,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:13,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 14:53:13,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:13,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1631819272, now seen corresponding path program 2 times [2025-03-04 14:53:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350772831] [2025-03-04 14:53:13,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:13,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 14:53:13,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:53:13,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:13,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:53:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350772831] [2025-03-04 14:53:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350772831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059292101] [2025-03-04 14:53:14,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:14,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:53:14,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 14:53:14,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:53:14,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:14,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:14,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:53:14,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:15,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059292101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2025-03-04 14:53:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50476231] [2025-03-04 14:53:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:15,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:15,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-04 14:53:15,833 INFO L87 Difference]: Start difference. First operand 2781 states and 3842 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:16,140 INFO L93 Difference]: Finished difference Result 5552 states and 7689 transitions. [2025-03-04 14:53:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:53:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 147 [2025-03-04 14:53:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:16,147 INFO L225 Difference]: With dead ends: 5552 [2025-03-04 14:53:16,147 INFO L226 Difference]: Without dead ends: 2816 [2025-03-04 14:53:16,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-04 14:53:16,150 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 15 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:16,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2594 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-03-04 14:53:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2809. [2025-03-04 14:53:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2707 states have (on average 1.3871444403398596) internal successors, (3755), 2719 states have internal predecessors, (3755), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3870 transitions. [2025-03-04 14:53:16,226 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3870 transitions. Word has length 147 [2025-03-04 14:53:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:16,226 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 3870 transitions. [2025-03-04 14:53:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3870 transitions. [2025-03-04 14:53:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 14:53:16,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:16,227 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:16,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 14:53:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:16,428 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 331036892, now seen corresponding path program 1 times [2025-03-04 14:53:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186875281] [2025-03-04 14:53:16,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:16,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 14:53:16,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 14:53:16,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:16,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186875281] [2025-03-04 14:53:16,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186875281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:16,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:16,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:53:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781471277] [2025-03-04 14:53:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:16,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:16,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:16,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:16,687 INFO L87 Difference]: Start difference. First operand 2809 states and 3870 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:17,058 INFO L93 Difference]: Finished difference Result 5594 states and 7725 transitions. [2025-03-04 14:53:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:53:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-03-04 14:53:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:17,066 INFO L225 Difference]: With dead ends: 5594 [2025-03-04 14:53:17,066 INFO L226 Difference]: Without dead ends: 2844 [2025-03-04 14:53:17,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:17,069 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 12 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:17,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2600 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2025-03-04 14:53:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2809. [2025-03-04 14:53:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2707 states have (on average 1.3871444403398596) internal successors, (3755), 2719 states have internal predecessors, (3755), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3870 transitions. [2025-03-04 14:53:17,124 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3870 transitions. Word has length 149 [2025-03-04 14:53:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:17,124 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 3870 transitions. [2025-03-04 14:53:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3870 transitions. [2025-03-04 14:53:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 14:53:17,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:17,126 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:17,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:53:17,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:17,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 155066851, now seen corresponding path program 1 times [2025-03-04 14:53:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676752496] [2025-03-04 14:53:17,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:17,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 14:53:17,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 14:53:17,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:17,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676752496] [2025-03-04 14:53:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676752496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:17,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:53:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114450108] [2025-03-04 14:53:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:17,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:53:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:53:17,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:53:17,493 INFO L87 Difference]: Start difference. First operand 2809 states and 3870 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:17,717 INFO L93 Difference]: Finished difference Result 5591 states and 7720 transitions. [2025-03-04 14:53:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:53:17,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-03-04 14:53:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:17,723 INFO L225 Difference]: With dead ends: 5591 [2025-03-04 14:53:17,723 INFO L226 Difference]: Without dead ends: 2830 [2025-03-04 14:53:17,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:53:17,727 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 8 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:17,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1778 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-03-04 14:53:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2025-03-04 14:53:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2728 states have (on average 1.3841642228739004) internal successors, (3776), 2740 states have internal predecessors, (3776), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3891 transitions. [2025-03-04 14:53:17,784 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3891 transitions. Word has length 149 [2025-03-04 14:53:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 2830 states and 3891 transitions. [2025-03-04 14:53:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3891 transitions. [2025-03-04 14:53:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 14:53:17,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:17,785 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:17,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:53:17,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 284353552, now seen corresponding path program 1 times [2025-03-04 14:53:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965339693] [2025-03-04 14:53:17,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:17,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 14:53:17,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 14:53:17,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:17,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965339693] [2025-03-04 14:53:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965339693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:18,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 14:53:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394840651] [2025-03-04 14:53:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:18,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:53:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:53:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:53:18,253 INFO L87 Difference]: Start difference. First operand 2830 states and 3891 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:18,597 INFO L93 Difference]: Finished difference Result 5663 states and 7798 transitions. [2025-03-04 14:53:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:53:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 150 [2025-03-04 14:53:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:18,607 INFO L225 Difference]: With dead ends: 5663 [2025-03-04 14:53:18,607 INFO L226 Difference]: Without dead ends: 2900 [2025-03-04 14:53:18,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:53:18,613 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 20 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:18,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3102 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-03-04 14:53:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2879. [2025-03-04 14:53:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2777 states have (on average 1.382427079582283) internal successors, (3839), 2789 states have internal predecessors, (3839), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3954 transitions. [2025-03-04 14:53:18,700 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3954 transitions. Word has length 150 [2025-03-04 14:53:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 3954 transitions. [2025-03-04 14:53:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3954 transitions. [2025-03-04 14:53:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 14:53:18,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:18,702 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:53:18,702 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:18,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1541230433, now seen corresponding path program 1 times [2025-03-04 14:53:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931350420] [2025-03-04 14:53:18,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:18,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 14:53:18,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 14:53:18,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:18,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:53:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931350420] [2025-03-04 14:53:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931350420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728111378] [2025-03-04 14:53:19,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:19,478 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:19,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:53:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 14:53:19,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 14:53:19,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:19,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:19,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 14:53:19,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:20,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728111378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:20,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2025-03-04 14:53:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010004085] [2025-03-04 14:53:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:20,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:53:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:20,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:53:20,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:53:20,030 INFO L87 Difference]: Start difference. First operand 2879 states and 3954 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:20,582 INFO L93 Difference]: Finished difference Result 5754 states and 7915 transitions. [2025-03-04 14:53:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:53:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 150 [2025-03-04 14:53:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:20,593 INFO L225 Difference]: With dead ends: 5754 [2025-03-04 14:53:20,593 INFO L226 Difference]: Without dead ends: 2949 [2025-03-04 14:53:20,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:53:20,597 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 17 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:20,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2644 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:53:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2025-03-04 14:53:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2914. [2025-03-04 14:53:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2812 states have (on average 1.3801564722617354) internal successors, (3881), 2824 states have internal predecessors, (3881), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3996 transitions. [2025-03-04 14:53:20,658 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3996 transitions. Word has length 150 [2025-03-04 14:53:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:20,658 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 3996 transitions. [2025-03-04 14:53:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3996 transitions. [2025-03-04 14:53:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 14:53:20,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:20,659 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:20,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 14:53:20,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 14:53:20,860 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1813519907, now seen corresponding path program 1 times [2025-03-04 14:53:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402419006] [2025-03-04 14:53:20,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 14:53:20,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 14:53:20,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:20,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402419006] [2025-03-04 14:53:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402419006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 14:53:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861208688] [2025-03-04 14:53:21,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:53:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:21,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:53:21,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:21,303 INFO L87 Difference]: Start difference. First operand 2914 states and 3996 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:21,719 INFO L93 Difference]: Finished difference Result 5817 states and 7999 transitions. [2025-03-04 14:53:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:53:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2025-03-04 14:53:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:21,726 INFO L225 Difference]: With dead ends: 5817 [2025-03-04 14:53:21,726 INFO L226 Difference]: Without dead ends: 2977 [2025-03-04 14:53:21,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:53:21,729 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 23 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:21,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3524 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-03-04 14:53:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2935. [2025-03-04 14:53:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2833 states have (on average 1.3773385104129898) internal successors, (3902), 2845 states have internal predecessors, (3902), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4017 transitions. [2025-03-04 14:53:21,782 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4017 transitions. Word has length 151 [2025-03-04 14:53:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:21,782 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 4017 transitions. [2025-03-04 14:53:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4017 transitions. [2025-03-04 14:53:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 14:53:21,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:21,783 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:21,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 14:53:21,783 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:21,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 305751634, now seen corresponding path program 1 times [2025-03-04 14:53:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860925777] [2025-03-04 14:53:21,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:21,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 14:53:21,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 14:53:21,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:21,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:53:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860925777] [2025-03-04 14:53:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860925777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439876449] [2025-03-04 14:53:22,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:22,488 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:22,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 14:53:22,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 14:53:22,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 14:53:22,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:22,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 14:53:22,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:53:23,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439876449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2025-03-04 14:53:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810792869] [2025-03-04 14:53:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:23,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:23,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-04 14:53:23,093 INFO L87 Difference]: Start difference. First operand 2935 states and 4017 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:23,360 INFO L93 Difference]: Finished difference Result 5837 states and 8004 transitions. [2025-03-04 14:53:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:53:23,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 151 [2025-03-04 14:53:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:23,365 INFO L225 Difference]: With dead ends: 5837 [2025-03-04 14:53:23,365 INFO L226 Difference]: Without dead ends: 2984 [2025-03-04 14:53:23,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-04 14:53:23,369 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 39 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:23,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2606 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-03-04 14:53:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2914. [2025-03-04 14:53:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2812 states have (on average 1.3776671408250356) internal successors, (3874), 2824 states have internal predecessors, (3874), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3989 transitions. [2025-03-04 14:53:23,423 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3989 transitions. Word has length 151 [2025-03-04 14:53:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:23,423 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 3989 transitions. [2025-03-04 14:53:23,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 14:53:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3989 transitions. [2025-03-04 14:53:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 14:53:23,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:23,424 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:23,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:23,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:23,625 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:23,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2093780110, now seen corresponding path program 1 times [2025-03-04 14:53:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736392642] [2025-03-04 14:53:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:23,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 14:53:23,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 14:53:23,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:23,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:53:24,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736392642] [2025-03-04 14:53:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736392642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5584645] [2025-03-04 14:53:24,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:24,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:24,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 14:53:24,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 14:53:24,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 14:53:24,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:24,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:24,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 14:53:24,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 12 proven. 127 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 14:53:25,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:53:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5584645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:25,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 10] total 40 [2025-03-04 14:53:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615219401] [2025-03-04 14:53:25,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:25,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 14:53:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:25,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 14:53:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 14:53:25,517 INFO L87 Difference]: Start difference. First operand 2914 states and 3989 transitions. Second operand has 40 states, 40 states have (on average 4.375) internal successors, (175), 40 states have internal predecessors, (175), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 14:53:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:27,488 INFO L93 Difference]: Finished difference Result 5839 states and 8056 transitions. [2025-03-04 14:53:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-04 14:53:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.375) internal successors, (175), 40 states have internal predecessors, (175), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 151 [2025-03-04 14:53:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:27,495 INFO L225 Difference]: With dead ends: 5839 [2025-03-04 14:53:27,495 INFO L226 Difference]: Without dead ends: 3027 [2025-03-04 14:53:27,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=850, Invalid=4552, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 14:53:27,501 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 60 mSDsluCounter, 9693 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 10181 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:27,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 10181 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 14:53:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-04 14:53:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2972. [2025-03-04 14:53:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2870 states have (on average 1.3693379790940767) internal successors, (3930), 2881 states have internal predecessors, (3930), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4045 transitions. [2025-03-04 14:53:27,599 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4045 transitions. Word has length 151 [2025-03-04 14:53:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:27,599 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4045 transitions. [2025-03-04 14:53:27,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.375) internal successors, (175), 40 states have internal predecessors, (175), 3 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 14:53:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4045 transitions. [2025-03-04 14:53:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 14:53:27,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:27,600 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:27,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 14:53:27,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 14:53:27,801 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1139598799, now seen corresponding path program 2 times [2025-03-04 14:53:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:27,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170218895] [2025-03-04 14:53:27,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:27,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-04 14:53:27,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 14:53:27,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:27,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 7 proven. 287 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-04 14:53:28,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:28,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170218895] [2025-03-04 14:53:28,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170218895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:28,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563644601] [2025-03-04 14:53:28,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:28,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:28,513 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:28,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 14:53:28,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-04 14:53:29,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 14:53:29,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:29,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 14:53:29,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 236 proven. 66 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 14:53:29,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 7 proven. 287 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-04 14:53:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563644601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:30,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 16] total 47 [2025-03-04 14:53:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097461018] [2025-03-04 14:53:30,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 14:53:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:30,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 14:53:30,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 14:53:30,164 INFO L87 Difference]: Start difference. First operand 2972 states and 4045 transitions. Second operand has 47 states, 47 states have (on average 3.978723404255319) internal successors, (187), 47 states have internal predecessors, (187), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:37,124 INFO L93 Difference]: Finished difference Result 5946 states and 8154 transitions. [2025-03-04 14:53:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 14:53:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.978723404255319) internal successors, (187), 47 states have internal predecessors, (187), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 164 [2025-03-04 14:53:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:37,131 INFO L225 Difference]: With dead ends: 5946 [2025-03-04 14:53:37,131 INFO L226 Difference]: Without dead ends: 3083 [2025-03-04 14:53:37,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1624, Invalid=5516, Unknown=0, NotChecked=0, Total=7140 [2025-03-04 14:53:37,136 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 31 mSDsluCounter, 11635 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12124 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:37,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12124 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 14:53:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-03-04 14:53:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3050. [2025-03-04 14:53:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 2948 states have (on average 1.3595658073270014) internal successors, (4008), 2959 states have internal predecessors, (4008), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4123 transitions. [2025-03-04 14:53:37,232 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4123 transitions. Word has length 164 [2025-03-04 14:53:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4123 transitions. [2025-03-04 14:53:37,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.978723404255319) internal successors, (187), 47 states have internal predecessors, (187), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 14:53:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4123 transitions. [2025-03-04 14:53:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 14:53:37,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:37,234 INFO L218 NwaCegarLoop]: trace histogram [41, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:37,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 14:53:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 14:53:37,434 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:37,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash 487376814, now seen corresponding path program 3 times [2025-03-04 14:53:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085090151] [2025-03-04 14:53:37,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:53:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:37,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 177 statements into 15 equivalence classes. [2025-03-04 14:53:37,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 112 of 177 statements. [2025-03-04 14:53:37,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 14:53:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-04 14:53:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085090151] [2025-03-04 14:53:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085090151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:53:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529349651] [2025-03-04 14:53:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:37,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:37,695 INFO L87 Difference]: Start difference. First operand 3050 states and 4123 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:38,068 INFO L93 Difference]: Finished difference Result 6049 states and 8196 transitions. [2025-03-04 14:53:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:53:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-04 14:53:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:38,074 INFO L225 Difference]: With dead ends: 6049 [2025-03-04 14:53:38,074 INFO L226 Difference]: Without dead ends: 3071 [2025-03-04 14:53:38,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:38,078 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 8 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:38,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2584 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2025-03-04 14:53:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2025-03-04 14:53:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2969 states have (on average 1.357022566520714) internal successors, (4029), 2980 states have internal predecessors, (4029), 54 states have call successors, (54), 43 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 14:53:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4144 transitions. [2025-03-04 14:53:38,168 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4144 transitions. Word has length 177 [2025-03-04 14:53:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4144 transitions. [2025-03-04 14:53:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 14:53:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4144 transitions. [2025-03-04 14:53:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 14:53:38,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:38,169 INFO L218 NwaCegarLoop]: trace histogram [41, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 14:53:38,169 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 14:53:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1045553938, now seen corresponding path program 1 times [2025-03-04 14:53:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544582514] [2025-03-04 14:53:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 14:53:38,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 14:53:38,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:38,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 7 proven. 755 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-04 14:53:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544582514] [2025-03-04 14:53:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544582514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990138932] [2025-03-04 14:53:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:39,665 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:53:39,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 14:53:40,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 14:53:42,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 14:53:42,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:42,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 355 conjuncts are in the unsatisfiable core [2025-03-04 14:53:42,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:42,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 14:53:42,454 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 14:53:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 14:53:42,500 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 [2025-03-04 14:53:42,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-03-04 14:53:42,616 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 22 treesize of output 10