./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_BER_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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:02:50,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:02:50,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:02:50,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:02:50,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:02:50,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:02:50,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:02:50,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:02:50,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:02:50,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:02:50,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:02:50,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:02:50,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:02:50,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:02:50,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:02:50,207 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:02:50,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:02:50,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:02:50,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:02:50,208 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2025-03-09 06:02:50,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:02:50,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:02:50,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:02:50,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:02:50,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:02:50,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2025-03-09 06:02:51,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9acdf84/f84ea09a66674c76837a8be6ce1e28bc/FLAG2de078d86 [2025-03-09 06:02:51,933 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:02:51,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2025-03-09 06:02:51,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9acdf84/f84ea09a66674c76837a8be6ce1e28bc/FLAG2de078d86 [2025-03-09 06:02:52,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9acdf84/f84ea09a66674c76837a8be6ce1e28bc [2025-03-09 06:02:52,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:02:52,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:02:52,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:02:52,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:02:52,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:02:52,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48eb28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52, skipping insertion in model container [2025-03-09 06:02:52,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:02:52,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:02:52,571 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:02:52,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:02:52,691 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:02:52,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52 WrapperNode [2025-03-09 06:02:52,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:02:52,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:02:52,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:02:52,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:02:52,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,761 INFO L138 Inliner]: procedures = 282, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2025-03-09 06:02:52,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:02:52,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:02:52,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:02:52,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:02:52,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,842 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-09 06:02:52,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:02:52,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:02:52,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:02:52,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:02:52,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (1/1) ... [2025-03-09 06:02:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:02:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:02:52,933 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-09 06:02:52,936 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-09 06:02:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 06:02:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-09 06:02:52,951 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:02:52,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-09 06:02:52,951 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:02:52,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-09 06:02:52,952 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:02:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:02:52,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:02:53,098 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:02:53,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:02:53,144 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-09 06:02:54,053 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-09 06:02:54,054 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-09 06:02:54,054 INFO L1307 $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-09 06:02:54,110 INFO L? ?]: Removed 345 outVars from TransFormulas that were not future-live. [2025-03-09 06:02:54,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:02:54,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:02:54,152 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:02:54,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:02:54 BoogieIcfgContainer [2025-03-09 06:02:54,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:02:54,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:02:54,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:02:54,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:02:54,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:02:52" (1/3) ... [2025-03-09 06:02:54,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cbcd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:02:54, skipping insertion in model container [2025-03-09 06:02:54,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:02:52" (2/3) ... [2025-03-09 06:02:54,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cbcd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:02:54, skipping insertion in model container [2025-03-09 06:02:54,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:02:54" (3/3) ... [2025-03-09 06:02:54,159 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2025-03-09 06:02:54,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:02:54,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test6-1.i that has 6 procedures, 457 locations, 1 initial locations, 34 loop locations, and 14 error locations. [2025-03-09 06:02:54,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:02:54,221 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;@dd960e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:02:54,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 06:02:54,224 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-09 06:02:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:02:54,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:54,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:02:54,229 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-09 06:02:54,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -945499652, now seen corresponding path program 1 times [2025-03-09 06:02:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247595465] [2025-03-09 06:02:54,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:54,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:02:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:02:54,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:54,377 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-09 06:02:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247595465] [2025-03-09 06:02:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247595465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:54,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:54,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:02:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994651361] [2025-03-09 06:02:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:02:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:54,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:02:54,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:02:54,399 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-09 06:02:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:54,508 INFO L93 Difference]: Finished difference Result 907 states and 1421 transitions. [2025-03-09 06:02:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:02:54,509 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-09 06:02:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:54,516 INFO L225 Difference]: With dead ends: 907 [2025-03-09 06:02:54,517 INFO L226 Difference]: Without dead ends: 438 [2025-03-09 06:02:54,521 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-09 06:02:54,523 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-09 06:02:54,525 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-09 06:02:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-09 06:02:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-09 06:02:54,571 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-09 06:02:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 616 transitions. [2025-03-09 06:02:54,578 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 616 transitions. Word has length 8 [2025-03-09 06:02:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 616 transitions. [2025-03-09 06:02:54,579 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-09 06:02:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 616 transitions. [2025-03-09 06:02:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:02:54,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:54,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:02:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:02:54,580 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-09 06:02:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash -945498691, now seen corresponding path program 1 times [2025-03-09 06:02:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888584148] [2025-03-09 06:02:54,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:54,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:02:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:02:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:02:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560436691] [2025-03-09 06:02:54,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:02:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:02:54,635 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-09 06:02:54,636 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-09 06:02:54,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:02:54,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:02:54,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:54,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:02:54,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:02:54,804 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-09 06:02:54,835 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-09 06:02:54,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:02:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888584148] [2025-03-09 06:02:54,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:02:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560436691] [2025-03-09 06:02:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560436691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:02:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350824003] [2025-03-09 06:02:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:54,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:02:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:54,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:02:54,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:02:54,839 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-09 06:02:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:55,088 INFO L93 Difference]: Finished difference Result 842 states and 1199 transitions. [2025-03-09 06:02:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:02:55,089 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-09 06:02:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:55,094 INFO L225 Difference]: With dead ends: 842 [2025-03-09 06:02:55,094 INFO L226 Difference]: Without dead ends: 840 [2025-03-09 06:02:55,095 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-09 06:02:55,095 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 557 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 06:02:55,096 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-09 06:02:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-09 06:02:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 445. [2025-03-09 06:02:55,112 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-09 06:02:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 624 transitions. [2025-03-09 06:02:55,117 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 624 transitions. Word has length 8 [2025-03-09 06:02:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 624 transitions. [2025-03-09 06:02:55,117 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-09 06:02:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 624 transitions. [2025-03-09 06:02:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 06:02:55,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:55,119 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-09 06:02:55,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:02:55,319 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-09 06:02:55,320 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-09 06:02:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1620078048, now seen corresponding path program 1 times [2025-03-09 06:02:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158066331] [2025-03-09 06:02:55,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:55,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:02:55,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:02:55,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:55,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:55,643 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-09 06:02:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158066331] [2025-03-09 06:02:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158066331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:55,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:02:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168598257] [2025-03-09 06:02:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:55,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:02:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:55,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:02:55,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:02:55,648 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-09 06:02:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:55,778 INFO L93 Difference]: Finished difference Result 839 states and 1172 transitions. [2025-03-09 06:02:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:02:55,779 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-09 06:02:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:55,782 INFO L225 Difference]: With dead ends: 839 [2025-03-09 06:02:55,783 INFO L226 Difference]: Without dead ends: 403 [2025-03-09 06:02:55,784 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-09 06:02:55,785 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-09 06:02:55,785 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-09 06:02:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-09 06:02:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-09 06:02:55,802 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-09 06:02:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 547 transitions. [2025-03-09 06:02:55,807 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 547 transitions. Word has length 62 [2025-03-09 06:02:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:55,807 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 547 transitions. [2025-03-09 06:02:55,807 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-09 06:02:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 547 transitions. [2025-03-09 06:02:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 06:02:55,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:55,809 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-09 06:02:55,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:02:55,809 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-09 06:02:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1726730970, now seen corresponding path program 1 times [2025-03-09 06:02:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552752962] [2025-03-09 06:02:55,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:55,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:02:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:02:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:56,072 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-09 06:02:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552752962] [2025-03-09 06:02:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552752962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:02:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103787217] [2025-03-09 06:02:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:02:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:56,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:02:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:02:56,074 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-09 06:02:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:56,207 INFO L93 Difference]: Finished difference Result 727 states and 997 transitions. [2025-03-09 06:02:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:02:56,207 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-09 06:02:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:56,212 INFO L225 Difference]: With dead ends: 727 [2025-03-09 06:02:56,213 INFO L226 Difference]: Without dead ends: 723 [2025-03-09 06:02:56,213 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-09 06:02:56,215 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-09 06:02:56,216 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-09 06:02:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-09 06:02:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 715. [2025-03-09 06:02:56,236 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-09 06:02:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 993 transitions. [2025-03-09 06:02:56,240 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 993 transitions. Word has length 62 [2025-03-09 06:02:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 993 transitions. [2025-03-09 06:02:56,240 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-09 06:02:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 993 transitions. [2025-03-09 06:02:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 06:02:56,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:56,242 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-09 06:02:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:02:56,243 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-09 06:02:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2053430496, now seen corresponding path program 1 times [2025-03-09 06:02:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907314533] [2025-03-09 06:02:56,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:02:56,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:02:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:56,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:56,457 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-09 06:02:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907314533] [2025-03-09 06:02:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907314533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:02:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182911627] [2025-03-09 06:02:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:56,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:02:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:56,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:02:56,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:02:56,458 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-09 06:02:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:56,647 INFO L93 Difference]: Finished difference Result 1675 states and 2370 transitions. [2025-03-09 06:02:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:02:56,647 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-09 06:02:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:56,653 INFO L225 Difference]: With dead ends: 1675 [2025-03-09 06:02:56,653 INFO L226 Difference]: Without dead ends: 1279 [2025-03-09 06:02:56,654 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-09 06:02:56,655 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-09 06:02:56,655 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-09 06:02:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-03-09 06:02:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 715. [2025-03-09 06:02:56,689 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-09 06:02:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 992 transitions. [2025-03-09 06:02:56,693 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 992 transitions. Word has length 68 [2025-03-09 06:02:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:56,694 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 992 transitions. [2025-03-09 06:02:56,694 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-09 06:02:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 992 transitions. [2025-03-09 06:02:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 06:02:56,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:56,698 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-09 06:02:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:02:56,698 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-09 06:02:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash 385671518, now seen corresponding path program 1 times [2025-03-09 06:02:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064117648] [2025-03-09 06:02:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:02:56,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:02:56,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:56,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:56,893 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-09 06:02:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:56,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064117648] [2025-03-09 06:02:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064117648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:02:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:02:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326735160] [2025-03-09 06:02:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:02:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:02:56,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:02:56,897 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-09 06:02:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:56,985 INFO L93 Difference]: Finished difference Result 943 states and 1304 transitions. [2025-03-09 06:02:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:02:56,985 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-09 06:02:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:56,989 INFO L225 Difference]: With dead ends: 943 [2025-03-09 06:02:56,990 INFO L226 Difference]: Without dead ends: 941 [2025-03-09 06:02:56,990 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-09 06:02:56,991 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-09 06:02:56,991 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-09 06:02:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-09 06:02:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 931. [2025-03-09 06:02:57,014 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-09 06:02:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1302 transitions. [2025-03-09 06:02:57,017 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1302 transitions. Word has length 72 [2025-03-09 06:02:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:57,018 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1302 transitions. [2025-03-09 06:02:57,018 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-09 06:02:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1302 transitions. [2025-03-09 06:02:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 06:02:57,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:57,020 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-09 06:02:57,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:02:57,021 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-09 06:02:57,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash -679971364, now seen corresponding path program 1 times [2025-03-09 06:02:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261837692] [2025-03-09 06:02:57,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 06:02:57,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 06:02:57,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:57,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:57,327 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-09 06:02:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261837692] [2025-03-09 06:02:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261837692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:02:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109911216] [2025-03-09 06:02:57,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:02:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:02:57,330 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-09 06:02:57,331 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-09 06:02:57,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 06:02:57,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 06:02:57,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:57,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:57,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:02:57,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:02:57,613 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-09 06:02:57,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:02:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109911216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:02:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:02:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-09 06:02:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478550869] [2025-03-09 06:02:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:02:57,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:02:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:02:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:02:57,616 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-09 06:02:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:57,773 INFO L93 Difference]: Finished difference Result 1253 states and 1750 transitions. [2025-03-09 06:02:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:02:57,773 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-09 06:02:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:57,779 INFO L225 Difference]: With dead ends: 1253 [2025-03-09 06:02:57,779 INFO L226 Difference]: Without dead ends: 1252 [2025-03-09 06:02:57,780 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-09 06:02:57,781 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-09 06:02:57,781 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-09 06:02:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-09 06:02:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1050. [2025-03-09 06:02:57,806 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-09 06:02:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1465 transitions. [2025-03-09 06:02:57,811 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1465 transitions. Word has length 81 [2025-03-09 06:02:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1465 transitions. [2025-03-09 06:02:57,811 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-09 06:02:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1465 transitions. [2025-03-09 06:02:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 06:02:57,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:57,812 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-09 06:02:57,825 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-09 06:02:58,012 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-09 06:02:58,012 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-09 06:02:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:02:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 395724174, now seen corresponding path program 1 times [2025-03-09 06:02:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:02:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570422498] [2025-03-09 06:02:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:02:58,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 06:02:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 06:02:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:58,222 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-09 06:02:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:02:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570422498] [2025-03-09 06:02:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570422498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:02:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130601992] [2025-03-09 06:02:58,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:02:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:02:58,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:02:58,225 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-09 06:02:58,227 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-09 06:02:58,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 06:02:58,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 06:02:58,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:02:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:02:58,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:02:58,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:02:58,533 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-09 06:02:58,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:02:58,746 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-09 06:02:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130601992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:02:58,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:02:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-09 06:02:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020480017] [2025-03-09 06:02:58,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:02:58,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:02:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:02:58,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:02:58,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:02:58,748 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-09 06:02:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:02:59,788 INFO L93 Difference]: Finished difference Result 2823 states and 3921 transitions. [2025-03-09 06:02:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:02:59,788 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-09 06:02:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:02:59,798 INFO L225 Difference]: With dead ends: 2823 [2025-03-09 06:02:59,798 INFO L226 Difference]: Without dead ends: 2821 [2025-03-09 06:02:59,800 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-09 06:02:59,800 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-09 06:02:59,801 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-09 06:02:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-03-09 06:02:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2338. [2025-03-09 06:02:59,848 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-09 06:02:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3273 transitions. [2025-03-09 06:02:59,856 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3273 transitions. Word has length 82 [2025-03-09 06:02:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:02:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3273 transitions. [2025-03-09 06:02:59,857 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-09 06:02:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3273 transitions. [2025-03-09 06:02:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:02:59,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:02:59,858 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-09 06:02:59,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:03:00,062 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-09 06:03:00,062 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-09 06:03:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 734834845, now seen corresponding path program 1 times [2025-03-09 06:03:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:00,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541579239] [2025-03-09 06:03:00,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:03:00,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:03:00,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:00,143 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-09 06:03:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541579239] [2025-03-09 06:03:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541579239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242998025] [2025-03-09 06:03:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:00,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:00,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:00,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:00,144 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-09 06:03:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:00,341 INFO L93 Difference]: Finished difference Result 4733 states and 6646 transitions. [2025-03-09 06:03:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:00,342 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-09 06:03:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:00,350 INFO L225 Difference]: With dead ends: 4733 [2025-03-09 06:03:00,351 INFO L226 Difference]: Without dead ends: 2404 [2025-03-09 06:03:00,356 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-09 06:03:00,357 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-09 06:03:00,357 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-09 06:03:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-09 06:03:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2393. [2025-03-09 06:03:00,404 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-09 06:03:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3366 transitions. [2025-03-09 06:03:00,415 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3366 transitions. Word has length 80 [2025-03-09 06:03:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:00,417 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3366 transitions. [2025-03-09 06:03:00,417 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-09 06:03:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3366 transitions. [2025-03-09 06:03:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 06:03:00,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:00,418 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-09 06:03:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:03:00,418 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-09 06:03:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 151452928, now seen corresponding path program 1 times [2025-03-09 06:03:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687647049] [2025-03-09 06:03:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:00,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 06:03:00,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 06:03:00,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:00,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:00,633 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-09 06:03:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687647049] [2025-03-09 06:03:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687647049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285173532] [2025-03-09 06:03:00,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:00,636 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-09 06:03:00,638 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-09 06:03:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 06:03:00,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 06:03:00,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:00,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:00,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:03:00,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:00,992 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-09 06:03:00,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:01,138 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-09 06:03:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285173532] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:01,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 06:03:01,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 12 [2025-03-09 06:03:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076319814] [2025-03-09 06:03:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:03:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:01,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:03:01,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:03:01,140 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-09 06:03:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:01,236 INFO L93 Difference]: Finished difference Result 2393 states and 3366 transitions. [2025-03-09 06:03:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:01,237 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-09 06:03:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:01,245 INFO L225 Difference]: With dead ends: 2393 [2025-03-09 06:03:01,246 INFO L226 Difference]: Without dead ends: 2392 [2025-03-09 06:03:01,247 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-09 06:03:01,247 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-09 06:03:01,247 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-09 06:03:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-09 06:03:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2025-03-09 06:03:01,294 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-09 06:03:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3361 transitions. [2025-03-09 06:03:01,302 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3361 transitions. Word has length 91 [2025-03-09 06:03:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:01,302 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3361 transitions. [2025-03-09 06:03:01,302 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-09 06:03:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3361 transitions. [2025-03-09 06:03:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 06:03:01,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:01,303 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-09 06:03:01,311 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-09 06:03:01,503 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-09 06:03:01,504 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-09 06:03:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 400073469, now seen corresponding path program 1 times [2025-03-09 06:03:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037061882] [2025-03-09 06:03:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:01,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 06:03:01,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:03:01,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:01,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:01,711 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-09 06:03:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:01,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037061882] [2025-03-09 06:03:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037061882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:01,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885314728] [2025-03-09 06:03:01,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:01,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:01,713 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-09 06:03:01,715 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-09 06:03:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 06:03:01,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:03:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:01,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:03:01,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:02,072 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-09 06:03:02,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:02,217 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-09 06:03:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885314728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:03:02,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:03:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-09 06:03:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092253584] [2025-03-09 06:03:02,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:03:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 06:03:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:02,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:03:02,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:03:02,219 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-09 06:03:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:02,761 INFO L93 Difference]: Finished difference Result 4749 states and 6675 transitions. [2025-03-09 06:03:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:03:02,761 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-09 06:03:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:02,776 INFO L225 Difference]: With dead ends: 4749 [2025-03-09 06:03:02,776 INFO L226 Difference]: Without dead ends: 4748 [2025-03-09 06:03:02,779 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-09 06:03:02,779 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-09 06:03:02,780 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-09 06:03:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-03-09 06:03:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4369. [2025-03-09 06:03:02,870 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-09 06:03:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6134 transitions. [2025-03-09 06:03:02,880 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6134 transitions. Word has length 92 [2025-03-09 06:03:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6134 transitions. [2025-03-09 06:03:02,881 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-09 06:03:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6134 transitions. [2025-03-09 06:03:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 06:03:02,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:02,882 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-09 06:03:02,890 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-09 06:03:03,082 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-09 06:03:03,083 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-09 06:03:03,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1897149704, now seen corresponding path program 1 times [2025-03-09 06:03:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471843424] [2025-03-09 06:03:03,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:03,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 06:03:03,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 06:03:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:03,325 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-09 06:03:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471843424] [2025-03-09 06:03:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471843424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106908886] [2025-03-09 06:03:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:03,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:03,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:03,326 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-09 06:03:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:03,536 INFO L93 Difference]: Finished difference Result 5891 states and 8329 transitions. [2025-03-09 06:03:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:03,536 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-09 06:03:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:03,552 INFO L225 Difference]: With dead ends: 5891 [2025-03-09 06:03:03,553 INFO L226 Difference]: Without dead ends: 5889 [2025-03-09 06:03:03,555 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-09 06:03:03,556 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-09 06:03:03,556 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-09 06:03:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5889 states. [2025-03-09 06:03:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5889 to 4535. [2025-03-09 06:03:03,686 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-09 06:03:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6351 transitions. [2025-03-09 06:03:03,697 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6351 transitions. Word has length 118 [2025-03-09 06:03:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6351 transitions. [2025-03-09 06:03:03,697 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-09 06:03:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6351 transitions. [2025-03-09 06:03:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 06:03:03,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:03,699 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-09 06:03:03,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:03:03,699 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-09 06:03:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 783839923, now seen corresponding path program 1 times [2025-03-09 06:03:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094821941] [2025-03-09 06:03:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:03,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 06:03:03,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 06:03:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:03,964 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-09 06:03:03,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:03,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094821941] [2025-03-09 06:03:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094821941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:03,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782673572] [2025-03-09 06:03:03,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:03,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:03,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:03,968 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-09 06:03:03,969 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-09 06:03:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 06:03:04,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 06:03:04,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:04,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:04,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:03:04,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:04,333 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-09 06:03:04,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782673572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-09 06:03:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975630653] [2025-03-09 06:03:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:04,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:04,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:03:04,339 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-09 06:03:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:04,646 INFO L93 Difference]: Finished difference Result 8548 states and 12022 transitions. [2025-03-09 06:03:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:03:04,654 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-09 06:03:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:04,673 INFO L225 Difference]: With dead ends: 8548 [2025-03-09 06:03:04,674 INFO L226 Difference]: Without dead ends: 4329 [2025-03-09 06:03:04,680 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-09 06:03:04,681 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-09 06:03:04,681 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-09 06:03:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2025-03-09 06:03:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 4329. [2025-03-09 06:03:04,767 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-09 06:03:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 6081 transitions. [2025-03-09 06:03:04,777 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 6081 transitions. Word has length 125 [2025-03-09 06:03:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:04,777 INFO L471 AbstractCegarLoop]: Abstraction has 4329 states and 6081 transitions. [2025-03-09 06:03:04,778 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-09 06:03:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 6081 transitions. [2025-03-09 06:03:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 06:03:04,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:04,779 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-09 06:03:04,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:04,980 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-09 06:03:04,980 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-09 06:03:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 432839929, now seen corresponding path program 1 times [2025-03-09 06:03:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123365539] [2025-03-09 06:03:04,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-09 06:03:05,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 06:03:05,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:05,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:05,314 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-09 06:03:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123365539] [2025-03-09 06:03:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123365539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533160124] [2025-03-09 06:03:05,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:05,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:05,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:05,317 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-09 06:03:05,319 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-09 06:03:05,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-09 06:03:05,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 06:03:05,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:05,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:05,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:03:05,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:05,687 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-09 06:03:05,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533160124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 11 [2025-03-09 06:03:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668267811] [2025-03-09 06:03:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:03:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:03:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:03:05,688 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-09 06:03:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:05,907 INFO L93 Difference]: Finished difference Result 6945 states and 9752 transitions. [2025-03-09 06:03:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:03:05,908 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-09 06:03:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:05,915 INFO L225 Difference]: With dead ends: 6945 [2025-03-09 06:03:05,915 INFO L226 Difference]: Without dead ends: 2699 [2025-03-09 06:03:05,923 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-09 06:03:05,923 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-09 06:03:05,924 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-09 06:03:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2025-03-09 06:03:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2025-03-09 06:03:05,969 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-09 06:03:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3750 transitions. [2025-03-09 06:03:05,974 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3750 transitions. Word has length 130 [2025-03-09 06:03:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3750 transitions. [2025-03-09 06:03:05,974 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-09 06:03:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3750 transitions. [2025-03-09 06:03:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-09 06:03:05,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:05,975 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-09 06:03:05,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:06,176 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-09 06:03:06,176 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-09 06:03:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash 230720251, now seen corresponding path program 1 times [2025-03-09 06:03:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069297826] [2025-03-09 06:03:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:06,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-09 06:03:06,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-09 06:03:06,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:06,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:06,569 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-09 06:03:06,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069297826] [2025-03-09 06:03:06,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069297826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186680783] [2025-03-09 06:03:06,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:06,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:06,572 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-09 06:03:06,573 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-09 06:03:06,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-09 06:03:06,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-09 06:03:06,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:06,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:03:06,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:06,918 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-09 06:03:06,935 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-09 06:03:06,949 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-09 06:03:07,476 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-09 06:03:07,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:07,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186680783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:07,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:07,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-09 06:03:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241950940] [2025-03-09 06:03:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:07,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:03:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:07,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:03:07,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:03:07,478 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-09 06:03:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:08,331 INFO L93 Difference]: Finished difference Result 6267 states and 8774 transitions. [2025-03-09 06:03:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:03:08,331 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-09 06:03:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:08,338 INFO L225 Difference]: With dead ends: 6267 [2025-03-09 06:03:08,338 INFO L226 Difference]: Without dead ends: 3615 [2025-03-09 06:03:08,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:03:08,342 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-09 06:03:08,342 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-09 06:03:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-03-09 06:03:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2697. [2025-03-09 06:03:08,388 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-09 06:03:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3749 transitions. [2025-03-09 06:03:08,394 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3749 transitions. Word has length 132 [2025-03-09 06:03:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:08,394 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3749 transitions. [2025-03-09 06:03:08,394 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-09 06:03:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3749 transitions. [2025-03-09 06:03:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-09 06:03:08,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:08,395 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-09 06:03:08,404 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-09 06:03:08,595 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-09 06:03:08,596 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-09 06:03:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1063136397, now seen corresponding path program 1 times [2025-03-09 06:03:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637636832] [2025-03-09 06:03:08,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:08,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-09 06:03:08,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-09 06:03:08,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:08,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:08,907 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-09 06:03:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637636832] [2025-03-09 06:03:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637636832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642919184] [2025-03-09 06:03:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:08,911 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-09 06:03:08,913 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-09 06:03:09,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-09 06:03:09,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-09 06:03:09,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:09,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:03:09,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:09,340 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-09 06:03:09,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:09,492 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-09 06:03:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642919184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:03:09,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:03:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 17 [2025-03-09 06:03:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305990701] [2025-03-09 06:03:09,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:03:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 06:03:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:09,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:03:09,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:03:09,494 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-09 06:03:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:09,889 INFO L93 Difference]: Finished difference Result 5364 states and 7477 transitions. [2025-03-09 06:03:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:03:09,890 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-09 06:03:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:09,895 INFO L225 Difference]: With dead ends: 5364 [2025-03-09 06:03:09,895 INFO L226 Difference]: Without dead ends: 2759 [2025-03-09 06:03:09,899 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-09 06:03:09,899 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:09,899 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.3s Time] [2025-03-09 06:03:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2025-03-09 06:03:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2737. [2025-03-09 06:03:09,942 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-09 06:03:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3800 transitions. [2025-03-09 06:03:09,946 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3800 transitions. Word has length 133 [2025-03-09 06:03:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:09,946 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 3800 transitions. [2025-03-09 06:03:09,947 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-09 06:03:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3800 transitions. [2025-03-09 06:03:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-09 06:03:09,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:09,947 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-09 06:03:09,956 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-09 06:03:10,152 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-09 06:03:10,152 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-09 06:03:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash 485171243, now seen corresponding path program 2 times [2025-03-09 06:03:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:10,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358887814] [2025-03-09 06:03:10,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:10,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-09 06:03:10,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-09 06:03:10,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:03:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:10,608 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-09 06:03:10,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358887814] [2025-03-09 06:03:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358887814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724093112] [2025-03-09 06:03:10,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:10,610 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-09 06:03:10,612 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-09 06:03:10,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-09 06:03:10,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 137 statements. [2025-03-09 06:03:10,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:03:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:10,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:03:10,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:10,872 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-09 06:03:10,882 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-09 06:03:10,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724093112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-09 06:03:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686365016] [2025-03-09 06:03:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:10,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:03:10,883 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-09 06:03:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:10,969 INFO L93 Difference]: Finished difference Result 2737 states and 3800 transitions. [2025-03-09 06:03:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:10,970 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-09 06:03:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:10,975 INFO L225 Difference]: With dead ends: 2737 [2025-03-09 06:03:10,975 INFO L226 Difference]: Without dead ends: 2736 [2025-03-09 06:03:10,975 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-09 06:03:10,976 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-09 06:03:10,976 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-09 06:03:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-09 06:03:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2736. [2025-03-09 06:03:11,015 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-09 06:03:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3794 transitions. [2025-03-09 06:03:11,019 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3794 transitions. Word has length 137 [2025-03-09 06:03:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 3794 transitions. [2025-03-09 06:03:11,020 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-09 06:03:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3794 transitions. [2025-03-09 06:03:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-09 06:03:11,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:11,020 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-09 06:03:11,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 06:03:11,221 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-09 06:03:11,221 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-09 06:03:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2139559961, now seen corresponding path program 1 times [2025-03-09 06:03:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874705282] [2025-03-09 06:03:11,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:11,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 06:03:11,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 06:03:11,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:11,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:11,647 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-09 06:03:11,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:11,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874705282] [2025-03-09 06:03:11,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874705282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:11,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627412500] [2025-03-09 06:03:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:11,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:11,650 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-09 06:03:11,651 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-09 06:03:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 06:03:12,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 06:03:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:12,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:03:12,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:12,227 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-09 06:03:12,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:12,500 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-09 06:03:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627412500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:03:12,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:03:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 27 [2025-03-09 06:03:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79502623] [2025-03-09 06:03:12,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:03:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 06:03:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:12,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:03:12,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:03:12,503 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-09 06:03:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:13,360 INFO L93 Difference]: Finished difference Result 5471 states and 7619 transitions. [2025-03-09 06:03:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:03:13,360 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-09 06:03:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:13,366 INFO L225 Difference]: With dead ends: 5471 [2025-03-09 06:03:13,367 INFO L226 Difference]: Without dead ends: 2812 [2025-03-09 06:03:13,370 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-09 06:03:13,371 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-09 06:03:13,371 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-09 06:03:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-09 06:03:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2781. [2025-03-09 06:03:13,422 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-09 06:03:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3842 transitions. [2025-03-09 06:03:13,426 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3842 transitions. Word has length 138 [2025-03-09 06:03:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:13,426 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3842 transitions. [2025-03-09 06:03:13,426 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-09 06:03:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3842 transitions. [2025-03-09 06:03:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-09 06:03:13,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:13,427 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-09 06:03:13,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 06:03:13,632 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-09 06:03:13,632 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-09 06:03:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1631819272, now seen corresponding path program 2 times [2025-03-09 06:03:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487926737] [2025-03-09 06:03:13,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:13,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-09 06:03:13,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-09 06:03:13,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:03:13,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:14,297 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-09 06:03:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487926737] [2025-03-09 06:03:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487926737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962739320] [2025-03-09 06:03:14,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:14,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:14,300 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-09 06:03:14,301 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-09 06:03:14,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-09 06:03:14,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-09 06:03:14,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:03:14,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:14,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:03:14,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:16,107 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-09 06:03:16,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962739320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:16,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2025-03-09 06:03:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957899419] [2025-03-09 06:03:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:16,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:16,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:03:16,109 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-09 06:03:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:16,445 INFO L93 Difference]: Finished difference Result 5552 states and 7689 transitions. [2025-03-09 06:03:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:03:16,446 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-09 06:03:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:16,452 INFO L225 Difference]: With dead ends: 5552 [2025-03-09 06:03:16,452 INFO L226 Difference]: Without dead ends: 2816 [2025-03-09 06:03:16,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:03:16,456 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:16,456 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.3s Time] [2025-03-09 06:03:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-03-09 06:03:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2809. [2025-03-09 06:03:16,508 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-09 06:03:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3870 transitions. [2025-03-09 06:03:16,513 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3870 transitions. Word has length 147 [2025-03-09 06:03:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 3870 transitions. [2025-03-09 06:03:16,513 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-09 06:03:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3870 transitions. [2025-03-09 06:03:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-09 06:03:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:16,514 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-09 06:03:16,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:16,714 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-09 06:03:16,715 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-09 06:03:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 331036892, now seen corresponding path program 1 times [2025-03-09 06:03:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110786953] [2025-03-09 06:03:16,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:16,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-09 06:03:16,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-09 06:03:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:16,989 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-09 06:03:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110786953] [2025-03-09 06:03:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110786953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:16,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:16,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:03:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350841807] [2025-03-09 06:03:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:16,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:16,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:16,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:16,990 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-09 06:03:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:17,325 INFO L93 Difference]: Finished difference Result 5594 states and 7725 transitions. [2025-03-09 06:03:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:03:17,326 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-09 06:03:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:17,333 INFO L225 Difference]: With dead ends: 5594 [2025-03-09 06:03:17,334 INFO L226 Difference]: Without dead ends: 2844 [2025-03-09 06:03:17,336 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-09 06:03:17,339 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 12 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 06:03:17,339 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-09 06:03:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2025-03-09 06:03:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2809. [2025-03-09 06:03:17,411 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-09 06:03:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3870 transitions. [2025-03-09 06:03:17,417 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3870 transitions. Word has length 149 [2025-03-09 06:03:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 3870 transitions. [2025-03-09 06:03:17,417 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-09 06:03:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3870 transitions. [2025-03-09 06:03:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-09 06:03:17,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:17,419 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-09 06:03:17,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 06:03:17,419 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-09 06:03:17,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 155066851, now seen corresponding path program 1 times [2025-03-09 06:03:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:17,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551191932] [2025-03-09 06:03:17,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-09 06:03:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-09 06:03:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:17,789 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-09 06:03:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551191932] [2025-03-09 06:03:17,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551191932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:17,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:17,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:03:17,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674128402] [2025-03-09 06:03:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:17,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:03:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:17,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:03:17,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:03:17,791 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-09 06:03:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:18,051 INFO L93 Difference]: Finished difference Result 5591 states and 7720 transitions. [2025-03-09 06:03:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:03:18,051 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-09 06:03:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:18,057 INFO L225 Difference]: With dead ends: 5591 [2025-03-09 06:03:18,057 INFO L226 Difference]: Without dead ends: 2830 [2025-03-09 06:03:18,060 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-09 06:03:18,061 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 8 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 06:03:18,062 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-09 06:03:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-03-09 06:03:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2025-03-09 06:03:18,141 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-09 06:03:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3891 transitions. [2025-03-09 06:03:18,147 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3891 transitions. Word has length 149 [2025-03-09 06:03:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:18,147 INFO L471 AbstractCegarLoop]: Abstraction has 2830 states and 3891 transitions. [2025-03-09 06:03:18,147 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-09 06:03:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3891 transitions. [2025-03-09 06:03:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-09 06:03:18,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:18,149 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-09 06:03:18,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 06:03:18,149 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-09 06:03:18,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash 284353552, now seen corresponding path program 1 times [2025-03-09 06:03:18,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008387229] [2025-03-09 06:03:18,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:18,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 06:03:18,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 06:03:18,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:18,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:18,532 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-09 06:03:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008387229] [2025-03-09 06:03:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008387229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:18,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:18,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:03:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751933991] [2025-03-09 06:03:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:03:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:18,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:03:18,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:03:18,533 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-09 06:03:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:18,830 INFO L93 Difference]: Finished difference Result 5663 states and 7798 transitions. [2025-03-09 06:03:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:03:18,833 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-09 06:03:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:18,840 INFO L225 Difference]: With dead ends: 5663 [2025-03-09 06:03:18,840 INFO L226 Difference]: Without dead ends: 2900 [2025-03-09 06:03:18,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:03:18,844 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.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:18,844 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.2s Time] [2025-03-09 06:03:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-03-09 06:03:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2879. [2025-03-09 06:03:18,895 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-09 06:03:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3954 transitions. [2025-03-09 06:03:18,900 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3954 transitions. Word has length 150 [2025-03-09 06:03:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:18,900 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 3954 transitions. [2025-03-09 06:03:18,900 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-09 06:03:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3954 transitions. [2025-03-09 06:03:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-09 06:03:18,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:18,901 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-09 06:03:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 06:03:18,901 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-09 06:03:18,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1541230433, now seen corresponding path program 1 times [2025-03-09 06:03:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229950578] [2025-03-09 06:03:18,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:18,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 06:03:19,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 06:03:19,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:19,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:19,534 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-09 06:03:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229950578] [2025-03-09 06:03:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229950578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104707563] [2025-03-09 06:03:19,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:19,537 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-09 06:03:19,538 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-09 06:03:19,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 06:03:19,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 06:03:19,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:19,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:03:19,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:20,140 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-09 06:03:20,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104707563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2025-03-09 06:03:20,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530600952] [2025-03-09 06:03:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:03:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:20,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:03:20,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:03:20,141 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-09 06:03:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:20,664 INFO L93 Difference]: Finished difference Result 5754 states and 7915 transitions. [2025-03-09 06:03:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:03:20,665 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-09 06:03:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:20,672 INFO L225 Difference]: With dead ends: 5754 [2025-03-09 06:03:20,672 INFO L226 Difference]: Without dead ends: 2949 [2025-03-09 06:03:20,676 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-09 06:03:20,676 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 17 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-09 06:03:20,676 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-09 06:03:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2025-03-09 06:03:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2914. [2025-03-09 06:03:20,730 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-09 06:03:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3996 transitions. [2025-03-09 06:03:20,736 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3996 transitions. Word has length 150 [2025-03-09 06:03:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 3996 transitions. [2025-03-09 06:03:20,736 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-09 06:03:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3996 transitions. [2025-03-09 06:03:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-09 06:03:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:20,737 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-09 06:03:20,747 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-09 06:03:20,937 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-09 06:03:20,938 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-09 06:03:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1813519907, now seen corresponding path program 1 times [2025-03-09 06:03:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297227674] [2025-03-09 06:03:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:20,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-09 06:03:20,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-09 06:03:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:21,407 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-09 06:03:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297227674] [2025-03-09 06:03:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297227674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:03:21,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137283903] [2025-03-09 06:03:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:21,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:03:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:03:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:03:21,410 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-09 06:03:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:21,802 INFO L93 Difference]: Finished difference Result 5817 states and 7999 transitions. [2025-03-09 06:03:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:03:21,803 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-09 06:03:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:21,809 INFO L225 Difference]: With dead ends: 5817 [2025-03-09 06:03:21,809 INFO L226 Difference]: Without dead ends: 2977 [2025-03-09 06:03:21,813 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-09 06:03:21,813 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-09 06:03:21,813 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-09 06:03:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-03-09 06:03:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2935. [2025-03-09 06:03:21,866 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-09 06:03:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4017 transitions. [2025-03-09 06:03:21,872 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4017 transitions. Word has length 151 [2025-03-09 06:03:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:21,872 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 4017 transitions. [2025-03-09 06:03:21,872 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-09 06:03:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4017 transitions. [2025-03-09 06:03:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-09 06:03:21,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:21,873 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-09 06:03:21,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 06:03:21,874 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-09 06:03:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 305751634, now seen corresponding path program 1 times [2025-03-09 06:03:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:21,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587551117] [2025-03-09 06:03:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-09 06:03:22,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-09 06:03:22,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:22,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:22,511 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-09 06:03:22,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587551117] [2025-03-09 06:03:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587551117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554776712] [2025-03-09 06:03:22,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:22,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:22,513 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-09 06:03:22,514 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-09 06:03:22,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-09 06:03:22,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-09 06:03:22,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:22,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:03:22,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:23,091 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-09 06:03:23,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554776712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2025-03-09 06:03:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010022488] [2025-03-09 06:03:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:23,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:23,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:03:23,092 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-09 06:03:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:23,361 INFO L93 Difference]: Finished difference Result 5837 states and 8004 transitions. [2025-03-09 06:03:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:03:23,362 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-09 06:03:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:23,368 INFO L225 Difference]: With dead ends: 5837 [2025-03-09 06:03:23,368 INFO L226 Difference]: Without dead ends: 2984 [2025-03-09 06:03:23,372 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-09 06:03:23,372 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-09 06:03:23,372 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-09 06:03:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-03-09 06:03:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2914. [2025-03-09 06:03:23,424 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-09 06:03:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3989 transitions. [2025-03-09 06:03:23,430 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3989 transitions. Word has length 151 [2025-03-09 06:03:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 3989 transitions. [2025-03-09 06:03:23,430 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-09 06:03:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3989 transitions. [2025-03-09 06:03:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-09 06:03:23,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:23,431 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-09 06:03:23,442 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-09 06:03:23,631 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-09 06:03:23,632 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-09 06:03:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2093780110, now seen corresponding path program 1 times [2025-03-09 06:03:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728488094] [2025-03-09 06:03:23,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:23,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-09 06:03:23,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-09 06:03:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:24,269 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-09 06:03:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728488094] [2025-03-09 06:03:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728488094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137553264] [2025-03-09 06:03:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:24,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:24,271 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-09 06:03:24,272 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-09 06:03:24,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-09 06:03:24,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-09 06:03:24,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:24,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:24,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 06:03:24,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:25,224 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-09 06:03:25,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:25,595 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-09 06:03:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137553264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:03:25,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:03:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 10] total 40 [2025-03-09 06:03:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440831397] [2025-03-09 06:03:25,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:03:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 06:03:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:25,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 06:03:25,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 06:03:25,597 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-09 06:03:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:27,413 INFO L93 Difference]: Finished difference Result 5839 states and 8056 transitions. [2025-03-09 06:03:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-09 06:03:27,414 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-09 06:03:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:27,420 INFO L225 Difference]: With dead ends: 5839 [2025-03-09 06:03:27,420 INFO L226 Difference]: Without dead ends: 3027 [2025-03-09 06:03:27,425 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-09 06:03:27,425 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 60 mSDsluCounter, 9693 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:27,425 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.7s Time] [2025-03-09 06:03:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-09 06:03:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2972. [2025-03-09 06:03:27,519 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-09 06:03:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4045 transitions. [2025-03-09 06:03:27,524 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4045 transitions. Word has length 151 [2025-03-09 06:03:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:27,525 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4045 transitions. [2025-03-09 06:03:27,525 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-09 06:03:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4045 transitions. [2025-03-09 06:03:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-09 06:03:27,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:27,526 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-09 06:03:27,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:27,727 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-09 06:03:27,728 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-09 06:03:27,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1139598799, now seen corresponding path program 2 times [2025-03-09 06:03:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948755644] [2025-03-09 06:03:27,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:27,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-09 06:03:27,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-09 06:03:27,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:03:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:28,488 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-09 06:03:28,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948755644] [2025-03-09 06:03:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948755644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944102241] [2025-03-09 06:03:28,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:03:28,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:28,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:28,491 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-09 06:03:28,492 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-09 06:03:28,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-03-09 06:03:29,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-09 06:03:29,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:03:29,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:29,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 06:03:29,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:29,515 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-09 06:03:29,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:03:30,146 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-09 06:03:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944102241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:03:30,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:03:30,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 16] total 47 [2025-03-09 06:03:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13480830] [2025-03-09 06:03:30,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:03:30,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-09 06:03:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:30,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-09 06:03:30,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 06:03:30,148 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-09 06:03:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:37,291 INFO L93 Difference]: Finished difference Result 5946 states and 8154 transitions. [2025-03-09 06:03:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 06:03:37,292 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-09 06:03:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:37,298 INFO L225 Difference]: With dead ends: 5946 [2025-03-09 06:03:37,298 INFO L226 Difference]: Without dead ends: 3083 [2025-03-09 06:03:37,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1624, Invalid=5516, Unknown=0, NotChecked=0, Total=7140 [2025-03-09 06:03:37,303 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-09 06:03:37,304 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-09 06:03:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-03-09 06:03:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3050. [2025-03-09 06:03:37,392 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-09 06:03:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4123 transitions. [2025-03-09 06:03:37,399 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4123 transitions. Word has length 164 [2025-03-09 06:03:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:37,399 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4123 transitions. [2025-03-09 06:03:37,400 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-09 06:03:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4123 transitions. [2025-03-09 06:03:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 06:03:37,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:37,401 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-09 06:03:37,414 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-09 06:03:37,602 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-09 06:03:37,602 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-09 06:03:37,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash 487376814, now seen corresponding path program 3 times [2025-03-09 06:03:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74066987] [2025-03-09 06:03:37,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:03:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:37,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 177 statements into 15 equivalence classes. [2025-03-09 06:03:37,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 112 of 177 statements. [2025-03-09 06:03:37,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:03:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:37,866 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-09 06:03:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74066987] [2025-03-09 06:03:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74066987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:03:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268087434] [2025-03-09 06:03:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:37,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:37,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:37,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:37,867 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-09 06:03:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:38,273 INFO L93 Difference]: Finished difference Result 6049 states and 8196 transitions. [2025-03-09 06:03:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:03:38,274 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-09 06:03:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:38,279 INFO L225 Difference]: With dead ends: 6049 [2025-03-09 06:03:38,279 INFO L226 Difference]: Without dead ends: 3071 [2025-03-09 06:03:38,283 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-09 06:03:38,283 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 8 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 06:03:38,284 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-09 06:03:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2025-03-09 06:03:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2025-03-09 06:03:38,369 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-09 06:03:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4144 transitions. [2025-03-09 06:03:38,374 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4144 transitions. Word has length 177 [2025-03-09 06:03:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:38,374 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4144 transitions. [2025-03-09 06:03:38,375 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-09 06:03:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4144 transitions. [2025-03-09 06:03:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 06:03:38,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:38,375 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-09 06:03:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 06:03:38,376 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-09 06:03:38,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1045553938, now seen corresponding path program 1 times [2025-03-09 06:03:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029638393] [2025-03-09 06:03:38,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:38,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-09 06:03:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 06:03:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:39,805 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-09 06:03:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029638393] [2025-03-09 06:03:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029638393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572630050] [2025-03-09 06:03:39,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:39,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:39,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:39,807 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-09 06:03:39,808 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-09 06:03:40,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-09 06:03:42,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 06:03:42,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:42,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 355 conjuncts are in the unsatisfiable core [2025-03-09 06:03:42,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:42,752 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-09 06:03:42,930 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 06:03:42,930 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-09 06:03:42,984 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-09 06:03:42,991 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-09 06:03:43,111 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