./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_SFH_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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:21:17,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:21:18,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:21:18,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:21:18,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:21:18,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:21:18,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:21:18,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:21:18,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:21:18,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:21:18,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:21:18,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:21:18,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:21:18,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:21:18,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:21:18,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:21:18,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:21:18,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:21:18,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:21:18,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:21:18,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:21:18,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:21:18,045 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2025-03-17 19:21:18,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:21:18,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:21:18,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:21:18,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:21:18,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:21:18,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2025-03-17 19:21:19,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097d2f32b/42baee54e9634955884cbb619c23255c/FLAGe78eb376e [2025-03-17 19:21:19,793 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:21:19,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2025-03-17 19:21:19,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097d2f32b/42baee54e9634955884cbb619c23255c/FLAGe78eb376e [2025-03-17 19:21:20,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097d2f32b/42baee54e9634955884cbb619c23255c [2025-03-17 19:21:20,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:21:20,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:21:20,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:21:20,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:21:20,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:21:20,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194c7628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20, skipping insertion in model container [2025-03-17 19:21:20,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:21:20,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:21:20,461 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:21:20,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:21:20,587 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:21:20,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20 WrapperNode [2025-03-17 19:21:20,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:21:20,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:21:20,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:21:20,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:21:20,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,671 INFO L138 Inliner]: procedures = 282, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2025-03-17 19:21:20,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:21:20,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:21:20,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:21:20,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:21:20,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,764 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-03-17 19:21:20,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:21:20,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:21:20,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:21:20,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:21:20,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (1/1) ... [2025-03-17 19:21:20,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:21:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:20,872 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-17 19:21:20,875 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-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 19:21:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:21:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-17 19:21:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:21:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:21:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:21:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:21:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:21:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:21:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:21:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-17 19:21:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-17 19:21:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 19:21:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:21:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:21:21,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:21:21,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:21:21,109 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-17 19:21:22,008 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-17 19:21:22,009 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-17 19:21:22,009 INFO L1322 $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-17 19:21:22,072 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-17 19:21:22,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:21:22,132 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:21:22,132 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:21:22,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:21:22 BoogieIcfgContainer [2025-03-17 19:21:22,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:21:22,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:21:22,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:21:22,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:21:22,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:21:20" (1/3) ... [2025-03-17 19:21:22,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d16e293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:21:22, skipping insertion in model container [2025-03-17 19:21:22,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:20" (2/3) ... [2025-03-17 19:21:22,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d16e293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:21:22, skipping insertion in model container [2025-03-17 19:21:22,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:21:22" (3/3) ... [2025-03-17 19:21:22,140 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2025-03-17 19:21:22,149 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:21:22,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test6-1.i that has 6 procedures, 454 locations, 1 initial locations, 34 loop locations, and 14 error locations. [2025-03-17 19:21:22,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:21:22,211 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;@3fb7a462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:21:22,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 19:21:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 454 states, 417 states have (on average 1.6067146282973621) internal successors, (670), 434 states have internal predecessors, (670), 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-17 19:21:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:21:22,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:22,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:22,219 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-17 19:21:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 514595481, now seen corresponding path program 1 times [2025-03-17 19:21:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002638238] [2025-03-17 19:21:22,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:22,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:21:22,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:21:22,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:22,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:22,370 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-17 19:21:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002638238] [2025-03-17 19:21:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002638238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:22,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033624585] [2025-03-17 19:21:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:22,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:21:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:22,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:21:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:21:22,391 INFO L87 Difference]: Start difference. First operand has 454 states, 417 states have (on average 1.6067146282973621) internal successors, (670), 434 states have internal predecessors, (670), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 19:21:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:22,520 INFO L93 Difference]: Finished difference Result 902 states and 1416 transitions. [2025-03-17 19:21:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:21:22,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 19:21:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:22,533 INFO L225 Difference]: With dead ends: 902 [2025-03-17 19:21:22,533 INFO L226 Difference]: Without dead ends: 435 [2025-03-17 19:21:22,537 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-17 19:21:22,539 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 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-17 19:21:22,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-17 19:21:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-03-17 19:21:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 407 states have (on average 1.457002457002457) internal successors, (593), 421 states have internal predecessors, (593), 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-17 19:21:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 613 transitions. [2025-03-17 19:21:22,599 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 613 transitions. Word has length 7 [2025-03-17 19:21:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:22,601 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 613 transitions. [2025-03-17 19:21:22,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 19:21:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 613 transitions. [2025-03-17 19:21:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:21:22,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:22,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:22,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:21:22,602 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-17 19:21:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash 514596442, now seen corresponding path program 1 times [2025-03-17 19:21:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628444134] [2025-03-17 19:21:22,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:22,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:21:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:21:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:21:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931659629] [2025-03-17 19:21:22,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:22,657 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-17 19:21:22,659 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-17 19:21:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:21:22,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:21:22,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:22,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:22,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:21:22,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:22,836 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-17 19:21:22,863 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-17 19:21:22,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628444134] [2025-03-17 19:21:22,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:21:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931659629] [2025-03-17 19:21:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931659629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033450271] [2025-03-17 19:21:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:22,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:22,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:22,868 INFO L87 Difference]: Start difference. First operand 435 states and 613 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-17 19:21:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:23,131 INFO L93 Difference]: Finished difference Result 838 states and 1195 transitions. [2025-03-17 19:21:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-17 19:21:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:23,140 INFO L225 Difference]: With dead ends: 838 [2025-03-17 19:21:23,140 INFO L226 Difference]: Without dead ends: 836 [2025-03-17 19:21:23,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 19:21:23,141 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 556 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1706 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-17 19:21:23,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1706 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-17 19:21:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 442. [2025-03-17 19:21:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 414 states have (on average 1.4516908212560387) internal successors, (601), 428 states have internal predecessors, (601), 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-17 19:21:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 621 transitions. [2025-03-17 19:21:23,179 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 621 transitions. Word has length 7 [2025-03-17 19:21:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 621 transitions. [2025-03-17 19:21:23,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-17 19:21:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 621 transitions. [2025-03-17 19:21:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 19:21:23,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:23,181 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] [2025-03-17 19:21:23,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:21:23,386 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-17 19:21:23,386 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-17 19:21:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1360794116, now seen corresponding path program 1 times [2025-03-17 19:21:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632426613] [2025-03-17 19:21:23,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:23,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:21:23,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:21:23,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:23,763 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-17 19:21:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632426613] [2025-03-17 19:21:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632426613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:21:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204044310] [2025-03-17 19:21:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:21:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:23,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:21:23,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:21:23,764 INFO L87 Difference]: Start difference. First operand 442 states and 621 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-17 19:21:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:23,917 INFO L93 Difference]: Finished difference Result 834 states and 1167 transitions. [2025-03-17 19:21:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:21:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 61 [2025-03-17 19:21:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:23,919 INFO L225 Difference]: With dead ends: 834 [2025-03-17 19:21:23,919 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 19:21:23,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:21:23,920 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 18 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:23,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1418 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 19:21:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-17 19:21:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 386 states have internal predecessors, (524), 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-17 19:21:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 544 transitions. [2025-03-17 19:21:23,942 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 544 transitions. Word has length 61 [2025-03-17 19:21:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:23,942 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 544 transitions. [2025-03-17 19:21:23,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-17 19:21:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 544 transitions. [2025-03-17 19:21:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 19:21:23,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:23,945 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] [2025-03-17 19:21:23,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:21:23,945 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-17 19:21:23,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 619202934, now seen corresponding path program 1 times [2025-03-17 19:21:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:23,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990500447] [2025-03-17 19:21:23,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:23,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:21:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:21:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,192 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-17 19:21:24,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990500447] [2025-03-17 19:21:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990500447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525318855] [2025-03-17 19:21:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:24,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,193 INFO L87 Difference]: Start difference. First operand 400 states and 544 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-17 19:21:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:24,320 INFO L93 Difference]: Finished difference Result 723 states and 993 transitions. [2025-03-17 19:21:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 61 [2025-03-17 19:21:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:24,324 INFO L225 Difference]: With dead ends: 723 [2025-03-17 19:21:24,325 INFO L226 Difference]: Without dead ends: 719 [2025-03-17 19:21:24,325 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-17 19:21:24,326 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 377 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1470 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-17 19:21:24,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1470 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-17 19:21:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 711. [2025-03-17 19:21:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 680 states have (on average 1.4161764705882354) internal successors, (963), 695 states have internal predecessors, (963), 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-17 19:21:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 989 transitions. [2025-03-17 19:21:24,344 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 989 transitions. Word has length 61 [2025-03-17 19:21:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:24,345 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 989 transitions. [2025-03-17 19:21:24,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-17 19:21:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2025-03-17 19:21:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 19:21:24,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:24,347 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] [2025-03-17 19:21:24,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:21:24,347 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-17 19:21:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2054098532, now seen corresponding path program 1 times [2025-03-17 19:21:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511746468] [2025-03-17 19:21:24,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:24,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 19:21:24,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:21:24,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:24,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,536 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-17 19:21:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511746468] [2025-03-17 19:21:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511746468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852357416] [2025-03-17 19:21:24,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:24,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,538 INFO L87 Difference]: Start difference. First operand 711 states and 989 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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-17 19:21:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:24,719 INFO L93 Difference]: Finished difference Result 1667 states and 2362 transitions. [2025-03-17 19:21:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-03-17 19:21:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:24,725 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 19:21:24,725 INFO L226 Difference]: Without dead ends: 1273 [2025-03-17 19:21:24,726 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-17 19:21:24,727 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 475 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 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-17 19:21:24,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1440 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-17 19:21:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 711. [2025-03-17 19:21:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 680 states have (on average 1.4147058823529413) internal successors, (962), 695 states have internal predecessors, (962), 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-17 19:21:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 988 transitions. [2025-03-17 19:21:24,763 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 988 transitions. Word has length 67 [2025-03-17 19:21:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:24,764 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 988 transitions. [2025-03-17 19:21:24,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 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-17 19:21:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 988 transitions. [2025-03-17 19:21:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 19:21:24,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:24,766 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] [2025-03-17 19:21:24,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:21:24,767 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-17 19:21:24,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1434511366, now seen corresponding path program 1 times [2025-03-17 19:21:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784259663] [2025-03-17 19:21:24,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:24,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 19:21:24,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 19:21:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,910 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-17 19:21:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784259663] [2025-03-17 19:21:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784259663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772915729] [2025-03-17 19:21:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:24,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:24,913 INFO L87 Difference]: Start difference. First operand 711 states and 988 transitions. Second operand has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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-17 19:21:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:25,007 INFO L93 Difference]: Finished difference Result 938 states and 1299 transitions. [2025-03-17 19:21:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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 71 [2025-03-17 19:21:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:25,011 INFO L225 Difference]: With dead ends: 938 [2025-03-17 19:21:25,011 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 19:21:25,012 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-17 19:21:25,012 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 403 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 987 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-17 19:21:25,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 987 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 19:21:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 926. [2025-03-17 19:21:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 887 states have (on average 1.4216459977452085) internal successors, (1261), 903 states have internal predecessors, (1261), 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-17 19:21:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1297 transitions. [2025-03-17 19:21:25,054 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1297 transitions. Word has length 71 [2025-03-17 19:21:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:25,056 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1297 transitions. [2025-03-17 19:21:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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-17 19:21:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1297 transitions. [2025-03-17 19:21:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:21:25,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:25,057 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] [2025-03-17 19:21:25,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:21:25,057 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-17 19:21:25,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -87399084, now seen corresponding path program 1 times [2025-03-17 19:21:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153746631] [2025-03-17 19:21:25,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:25,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:21:25,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:21:25,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:25,344 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-17 19:21:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153746631] [2025-03-17 19:21:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153746631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114535552] [2025-03-17 19:21:25,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:25,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:25,347 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-17 19:21:25,349 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-17 19:21:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:21:25,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:21:25,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:25,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:21:25,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:25,621 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-17 19:21:25,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114535552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-17 19:21:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978328672] [2025-03-17 19:21:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:21:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:25,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:21:25,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:21:25,624 INFO L87 Difference]: Start difference. First operand 926 states and 1297 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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-17 19:21:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:25,787 INFO L93 Difference]: Finished difference Result 1247 states and 1744 transitions. [2025-03-17 19:21:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:21:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 79 [2025-03-17 19:21:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:25,792 INFO L225 Difference]: With dead ends: 1247 [2025-03-17 19:21:25,792 INFO L226 Difference]: Without dead ends: 1246 [2025-03-17 19:21:25,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 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-17 19:21:25,793 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 496 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:25,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1395 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-17 19:21:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1045. [2025-03-17 19:21:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1004 states have (on average 1.4143426294820718) internal successors, (1420), 1021 states have internal predecessors, (1420), 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-17 19:21:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1460 transitions. [2025-03-17 19:21:25,825 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1460 transitions. Word has length 79 [2025-03-17 19:21:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:25,826 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1460 transitions. [2025-03-17 19:21:25,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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-17 19:21:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1460 transitions. [2025-03-17 19:21:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 19:21:25,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:25,827 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] [2025-03-17 19:21:25,834 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-17 19:21:26,027 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-17 19:21:26,028 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-17 19:21:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1585595670, now seen corresponding path program 1 times [2025-03-17 19:21:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594295182] [2025-03-17 19:21:26,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:26,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:21:26,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:21:26,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:26,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:26,246 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-17 19:21:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594295182] [2025-03-17 19:21:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594295182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062273817] [2025-03-17 19:21:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:26,249 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-17 19:21:26,251 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-17 19:21:26,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:21:26,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:21:26,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:26,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:21:26,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:26,600 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-17 19:21:26,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:26,798 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-17 19:21:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062273817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:21:26,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:21:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-17 19:21:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408532705] [2025-03-17 19:21:26,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:21:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 19:21:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:21:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:21:26,801 INFO L87 Difference]: Start difference. First operand 1045 states and 1460 transitions. Second operand has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 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-17 19:21:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:27,929 INFO L93 Difference]: Finished difference Result 2810 states and 3908 transitions. [2025-03-17 19:21:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:21:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 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 80 [2025-03-17 19:21:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:27,943 INFO L225 Difference]: With dead ends: 2810 [2025-03-17 19:21:27,943 INFO L226 Difference]: Without dead ends: 2808 [2025-03-17 19:21:27,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 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-17 19:21:27,946 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3387 mSDsluCounter, 7728 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 8278 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:27,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3397 Valid, 8278 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:21:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2025-03-17 19:21:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2327. [2025-03-17 19:21:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2239 states have (on average 1.3966056275122822) internal successors, (3127), 2258 states have internal predecessors, (3127), 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-17 19:21:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3262 transitions. [2025-03-17 19:21:28,041 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3262 transitions. Word has length 80 [2025-03-17 19:21:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:28,042 INFO L471 AbstractCegarLoop]: Abstraction has 2327 states and 3262 transitions. [2025-03-17 19:21:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 12.588235294117647) internal successors, (214), 15 states have internal predecessors, (214), 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-17 19:21:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3262 transitions. [2025-03-17 19:21:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:21:28,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:28,043 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] [2025-03-17 19:21:28,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:28,243 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-17 19:21:28,244 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-17 19:21:28,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1741030598, now seen corresponding path program 1 times [2025-03-17 19:21:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213108278] [2025-03-17 19:21:28,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:28,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:21:28,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:21:28,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:28,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:28,344 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-17 19:21:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213108278] [2025-03-17 19:21:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213108278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:28,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829847912] [2025-03-17 19:21:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:28,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:28,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:28,346 INFO L87 Difference]: Start difference. First operand 2327 states and 3262 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-17 19:21:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:28,536 INFO L93 Difference]: Finished difference Result 4711 states and 6624 transitions. [2025-03-17 19:21:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-03-17 19:21:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:28,544 INFO L225 Difference]: With dead ends: 4711 [2025-03-17 19:21:28,544 INFO L226 Difference]: Without dead ends: 2392 [2025-03-17 19:21:28,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 19:21:28,548 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 295 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1133 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-17 19:21:28,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1133 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-17 19:21:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2381. [2025-03-17 19:21:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2300 states have (on average 1.4052173913043478) internal successors, (3232), 2318 states have internal predecessors, (3232), 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-17 19:21:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3354 transitions. [2025-03-17 19:21:28,598 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3354 transitions. Word has length 79 [2025-03-17 19:21:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:28,598 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3354 transitions. [2025-03-17 19:21:28,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-17 19:21:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3354 transitions. [2025-03-17 19:21:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 19:21:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:28,599 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] [2025-03-17 19:21:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:21:28,599 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-17 19:21:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1139951992, now seen corresponding path program 1 times [2025-03-17 19:21:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722761618] [2025-03-17 19:21:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:28,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 19:21:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 19:21:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:28,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:28,827 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-17 19:21:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722761618] [2025-03-17 19:21:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722761618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867265194] [2025-03-17 19:21:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:28,833 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-17 19:21:28,834 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-17 19:21:28,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 19:21:29,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 19:21:29,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:29,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:21:29,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:29,170 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-17 19:21:29,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:29,327 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-17 19:21:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867265194] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:29,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 19:21:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 12 [2025-03-17 19:21:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375568538] [2025-03-17 19:21:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:29,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:21:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:29,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:21:29,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:21:29,329 INFO L87 Difference]: Start difference. First operand 2381 states and 3354 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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-17 19:21:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:29,422 INFO L93 Difference]: Finished difference Result 2381 states and 3354 transitions. [2025-03-17 19:21:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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 89 [2025-03-17 19:21:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:29,432 INFO L225 Difference]: With dead ends: 2381 [2025-03-17 19:21:29,432 INFO L226 Difference]: Without dead ends: 2380 [2025-03-17 19:21:29,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 170 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-17 19:21:29,433 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 961 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:29,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 493 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-17 19:21:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2025-03-17 19:21:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2300 states have (on average 1.4030434782608696) internal successors, (3227), 2317 states have internal predecessors, (3227), 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-17 19:21:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3349 transitions. [2025-03-17 19:21:29,497 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3349 transitions. Word has length 89 [2025-03-17 19:21:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:29,497 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3349 transitions. [2025-03-17 19:21:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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-17 19:21:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3349 transitions. [2025-03-17 19:21:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 19:21:29,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:29,499 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] [2025-03-17 19:21:29,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:21:29,699 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-17 19:21:29,699 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-17 19:21:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 978773380, now seen corresponding path program 1 times [2025-03-17 19:21:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343936729] [2025-03-17 19:21:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:29,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 19:21:29,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 19:21:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:29,884 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-17 19:21:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343936729] [2025-03-17 19:21:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343936729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844179363] [2025-03-17 19:21:29,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:29,886 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-17 19:21:29,888 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-17 19:21:30,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 19:21:30,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 19:21:30,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:30,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:30,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:21:30,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:30,209 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-17 19:21:30,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:30,344 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-17 19:21:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844179363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:21:30,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:21:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-17 19:21:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942473751] [2025-03-17 19:21:30,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:21:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:21:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:30,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:21:30,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:21:30,346 INFO L87 Difference]: Start difference. First operand 2380 states and 3349 transitions. Second operand has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 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-17 19:21:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:31,029 INFO L93 Difference]: Finished difference Result 4720 states and 6646 transitions. [2025-03-17 19:21:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:21:31,031 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 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 90 [2025-03-17 19:21:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:31,050 INFO L225 Difference]: With dead ends: 4720 [2025-03-17 19:21:31,050 INFO L226 Difference]: Without dead ends: 4719 [2025-03-17 19:21:31,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 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-17 19:21:31,054 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2037 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:31,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 3409 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:21:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2025-03-17 19:21:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4342. [2025-03-17 19:21:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4342 states, 4186 states have (on average 1.4025322503583373) internal successors, (5871), 4206 states have internal predecessors, (5871), 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-17 19:21:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4342 states to 4342 states and 6107 transitions. [2025-03-17 19:21:31,195 INFO L78 Accepts]: Start accepts. Automaton has 4342 states and 6107 transitions. Word has length 90 [2025-03-17 19:21:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 4342 states and 6107 transitions. [2025-03-17 19:21:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 13 states have internal predecessors, (225), 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-17 19:21:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4342 states and 6107 transitions. [2025-03-17 19:21:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 19:21:31,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:31,197 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 19:21:31,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 19:21:31,397 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-17 19:21:31,398 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-17 19:21:31,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 635402849, now seen corresponding path program 1 times [2025-03-17 19:21:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592621400] [2025-03-17 19:21:31,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 19:21:31,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 19:21:31,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:31,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:21:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592621400] [2025-03-17 19:21:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592621400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434239437] [2025-03-17 19:21:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:31,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:31,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:31,651 INFO L87 Difference]: Start difference. First operand 4342 states and 6107 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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-17 19:21:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:31,940 INFO L93 Difference]: Finished difference Result 5852 states and 8290 transitions. [2025-03-17 19:21:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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 115 [2025-03-17 19:21:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:31,965 INFO L225 Difference]: With dead ends: 5852 [2025-03-17 19:21:31,965 INFO L226 Difference]: Without dead ends: 5850 [2025-03-17 19:21:31,968 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-17 19:21:31,969 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 389 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1409 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:31,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1409 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2025-03-17 19:21:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 4508. [2025-03-17 19:21:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4508 states, 4343 states have (on average 1.3969606262951877) internal successors, (6067), 4364 states have internal predecessors, (6067), 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-17 19:21:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 6324 transitions. [2025-03-17 19:21:32,096 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 6324 transitions. Word has length 115 [2025-03-17 19:21:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:32,096 INFO L471 AbstractCegarLoop]: Abstraction has 4508 states and 6324 transitions. [2025-03-17 19:21:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 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-17 19:21:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 6324 transitions. [2025-03-17 19:21:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 19:21:32,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:32,102 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] [2025-03-17 19:21:32,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:21:32,102 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-17 19:21:32,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash -258285576, now seen corresponding path program 1 times [2025-03-17 19:21:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657998365] [2025-03-17 19:21:32,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:32,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 19:21:32,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 19:21:32,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:32,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:21:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657998365] [2025-03-17 19:21:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657998365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658114676] [2025-03-17 19:21:32,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:32,373 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-17 19:21:32,375 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-17 19:21:32,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 19:21:32,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 19:21:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:32,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:21:32,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:21:32,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658114676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-17 19:21:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989744434] [2025-03-17 19:21:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:32,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:21:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:32,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:21:32,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:32,733 INFO L87 Difference]: Start difference. First operand 4508 states and 6324 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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-17 19:21:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:32,974 INFO L93 Difference]: Finished difference Result 8501 states and 11975 transitions. [2025-03-17 19:21:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:21:32,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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 122 [2025-03-17 19:21:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:32,987 INFO L225 Difference]: With dead ends: 8501 [2025-03-17 19:21:32,987 INFO L226 Difference]: Without dead ends: 4305 [2025-03-17 19:21:32,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 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-17 19:21:32,994 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 84 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:32,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 2314 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2025-03-17 19:21:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 4305. [2025-03-17 19:21:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4157 states have (on average 1.401972576377195) internal successors, (5828), 4176 states have internal predecessors, (5828), 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-17 19:21:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6057 transitions. [2025-03-17 19:21:33,111 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6057 transitions. Word has length 122 [2025-03-17 19:21:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 4305 states and 6057 transitions. [2025-03-17 19:21:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 5 states have internal predecessors, (109), 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-17 19:21:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6057 transitions. [2025-03-17 19:21:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 19:21:33,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:33,113 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 19:21:33,121 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-17 19:21:33,313 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-17 19:21:33,314 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-17 19:21:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1743599207, now seen corresponding path program 1 times [2025-03-17 19:21:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865588086] [2025-03-17 19:21:33,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:33,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 19:21:33,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 19:21:33,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:33,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:21:33,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865588086] [2025-03-17 19:21:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865588086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930109222] [2025-03-17 19:21:33,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:33,614 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-17 19:21:33,615 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-17 19:21:33,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 19:21:33,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 19:21:33,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:33,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:33,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:21:33,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:33,941 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-17 19:21:33,958 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-17 19:21:33,974 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-17 19:21:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:21:34,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930109222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2025-03-17 19:21:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569464763] [2025-03-17 19:21:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:34,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:21:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:34,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:21:34,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:21:34,489 INFO L87 Difference]: Start difference. First operand 4305 states and 6057 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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-17 19:21:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:35,774 INFO L93 Difference]: Finished difference Result 9922 states and 14033 transitions. [2025-03-17 19:21:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:21:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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 127 [2025-03-17 19:21:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:35,787 INFO L225 Difference]: With dead ends: 9922 [2025-03-17 19:21:35,788 INFO L226 Difference]: Without dead ends: 5661 [2025-03-17 19:21:35,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:21:35,796 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 596 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:35,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2914 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 19:21:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2025-03-17 19:21:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 4305. [2025-03-17 19:21:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4157 states have (on average 1.4017320182824151) internal successors, (5827), 4176 states have internal predecessors, (5827), 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-17 19:21:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6056 transitions. [2025-03-17 19:21:35,926 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6056 transitions. Word has length 127 [2025-03-17 19:21:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:35,927 INFO L471 AbstractCegarLoop]: Abstraction has 4305 states and 6056 transitions. [2025-03-17 19:21:35,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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-17 19:21:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6056 transitions. [2025-03-17 19:21:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 19:21:35,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:35,928 INFO L218 NwaCegarLoop]: trace histogram [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-17 19:21:35,940 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-17 19:21:36,132 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-17 19:21:36,132 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-17 19:21:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1022554767, now seen corresponding path program 1 times [2025-03-17 19:21:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575003975] [2025-03-17 19:21:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:36,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 19:21:36,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 19:21:36,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:36,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:21:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575003975] [2025-03-17 19:21:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575003975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332745587] [2025-03-17 19:21:36,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:36,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:36,462 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-17 19:21:36,464 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-17 19:21:36,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 19:21:36,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 19:21:36,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:36,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:21:36,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:21:36,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332745587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2025-03-17 19:21:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809804406] [2025-03-17 19:21:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:36,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:21:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:36,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:21:36,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:21:36,926 INFO L87 Difference]: Start difference. First operand 4305 states and 6056 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:21:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:37,085 INFO L93 Difference]: Finished difference Result 8530 states and 12038 transitions. [2025-03-17 19:21:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:21:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 128 [2025-03-17 19:21:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:37,100 INFO L225 Difference]: With dead ends: 8530 [2025-03-17 19:21:37,101 INFO L226 Difference]: Without dead ends: 4332 [2025-03-17 19:21:37,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:21:37,107 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 6 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2427 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2025-03-17 19:21:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4332. [2025-03-17 19:21:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4332 states, 4176 states have (on average 1.4018199233716475) internal successors, (5854), 4203 states have internal predecessors, (5854), 97 states have call successors, (97), 44 states have call predecessors, (97), 46 states have return successors, (146), 84 states have call predecessors, (146), 97 states have call successors, (146) [2025-03-17 19:21:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 6097 transitions. [2025-03-17 19:21:37,189 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 6097 transitions. Word has length 128 [2025-03-17 19:21:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:37,190 INFO L471 AbstractCegarLoop]: Abstraction has 4332 states and 6097 transitions. [2025-03-17 19:21:37,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 19:21:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 6097 transitions. [2025-03-17 19:21:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 19:21:37,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:37,191 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-17 19:21:37,200 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-17 19:21:37,391 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-17 19:21:37,391 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-17 19:21:37,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1181637845, now seen corresponding path program 1 times [2025-03-17 19:21:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688895843] [2025-03-17 19:21:37,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 19:21:37,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 19:21:37,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:37,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:21:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688895843] [2025-03-17 19:21:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688895843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762643570] [2025-03-17 19:21:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:37,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:37,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:37,762 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-17 19:21:37,764 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-17 19:21:37,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 19:21:38,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 19:21:38,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:38,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:38,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:21:38,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:21:38,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:21:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762643570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:21:38,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:21:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 17 [2025-03-17 19:21:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407894597] [2025-03-17 19:21:38,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:21:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 19:21:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:38,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:21:38,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:21:38,317 INFO L87 Difference]: Start difference. First operand 4332 states and 6097 transitions. Second operand has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 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-17 19:21:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:38,816 INFO L93 Difference]: Finished difference Result 6990 states and 9839 transitions. [2025-03-17 19:21:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:21:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 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 130 [2025-03-17 19:21:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:38,825 INFO L225 Difference]: With dead ends: 6990 [2025-03-17 19:21:38,825 INFO L226 Difference]: Without dead ends: 2733 [2025-03-17 19:21:38,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:21:38,831 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 31 mSDsluCounter, 6276 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6763 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:38,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6763 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:21:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-17 19:21:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2716. [2025-03-17 19:21:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2613 states have (on average 1.4022196708763872) internal successors, (3664), 2626 states have internal predecessors, (3664), 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-17 19:21:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3779 transitions. [2025-03-17 19:21:38,913 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3779 transitions. Word has length 130 [2025-03-17 19:21:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:38,913 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 3779 transitions. [2025-03-17 19:21:38,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 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-17 19:21:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3779 transitions. [2025-03-17 19:21:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 19:21:38,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:38,915 INFO L218 NwaCegarLoop]: trace histogram [6, 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-17 19:21:38,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:21:39,119 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-17 19:21:39,119 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-17 19:21:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1234069871, now seen corresponding path program 2 times [2025-03-17 19:21:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638607239] [2025-03-17 19:21:39,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:21:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:39,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:21:39,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 19:21:39,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:21:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:21:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:39,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638607239] [2025-03-17 19:21:39,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638607239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:39,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333749881] [2025-03-17 19:21:39,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:21:39,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:39,576 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-17 19:21:39,578 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-17 19:21:39,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:21:39,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 134 statements. [2025-03-17 19:21:39,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:21:39,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:39,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:21:39,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:39,836 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-17 19:21:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 19:21:39,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333749881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-17 19:21:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981498362] [2025-03-17 19:21:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:39,846 INFO L87 Difference]: Start difference. First operand 2716 states and 3779 transitions. Second operand has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 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-17 19:21:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:39,924 INFO L93 Difference]: Finished difference Result 2716 states and 3779 transitions. [2025-03-17 19:21:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 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 134 [2025-03-17 19:21:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:39,932 INFO L225 Difference]: With dead ends: 2716 [2025-03-17 19:21:39,932 INFO L226 Difference]: Without dead ends: 2715 [2025-03-17 19:21:39,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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-17 19:21:39,933 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 982 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-17 19:21:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 982 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:21:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-17 19:21:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2025-03-17 19:21:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2613 states have (on average 1.3999234596249521) internal successors, (3658), 2625 states have internal predecessors, (3658), 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-17 19:21:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3773 transitions. [2025-03-17 19:21:39,981 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3773 transitions. Word has length 134 [2025-03-17 19:21:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3773 transitions. [2025-03-17 19:21:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 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-17 19:21:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3773 transitions. [2025-03-17 19:21:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 19:21:39,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:39,982 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] [2025-03-17 19:21:39,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:40,183 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-17 19:21:40,183 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-17 19:21:40,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -398538975, now seen corresponding path program 1 times [2025-03-17 19:21:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967016325] [2025-03-17 19:21:40,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:40,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:21:40,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:21:40,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:21:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967016325] [2025-03-17 19:21:40,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967016325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356365103] [2025-03-17 19:21:40,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:40,756 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-17 19:21:40,768 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-17 19:21:41,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:21:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:21:41,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:41,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:21:41,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:21:41,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:21:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356365103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:21:41,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:21:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 27 [2025-03-17 19:21:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802321448] [2025-03-17 19:21:41,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:21:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 19:21:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:21:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:21:41,528 INFO L87 Difference]: Start difference. First operand 2715 states and 3773 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 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-17 19:21:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:42,483 INFO L93 Difference]: Finished difference Result 5411 states and 7559 transitions. [2025-03-17 19:21:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:21:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 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 135 [2025-03-17 19:21:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:42,489 INFO L225 Difference]: With dead ends: 5411 [2025-03-17 19:21:42,490 INFO L226 Difference]: Without dead ends: 2785 [2025-03-17 19:21:42,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 19:21:42,493 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 57 mSDsluCounter, 7061 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 7536 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:42,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 7536 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:21:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2025-03-17 19:21:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2760. [2025-03-17 19:21:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2658 states have (on average 1.3942814145974416) internal successors, (3706), 2670 states have internal predecessors, (3706), 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-17 19:21:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3821 transitions. [2025-03-17 19:21:42,550 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3821 transitions. Word has length 135 [2025-03-17 19:21:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:42,550 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 3821 transitions. [2025-03-17 19:21:42,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 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-17 19:21:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3821 transitions. [2025-03-17 19:21:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 19:21:42,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:42,551 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-03-17 19:21:42,560 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-17 19:21:42,752 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-17 19:21:42,753 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-17 19:21:42,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash -928034212, now seen corresponding path program 2 times [2025-03-17 19:21:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:42,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342272958] [2025-03-17 19:21:42,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:21:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:42,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:21:42,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:21:42,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:21:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 125 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 19:21:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342272958] [2025-03-17 19:21:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342272958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256304174] [2025-03-17 19:21:43,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:21:43,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:43,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:43,603 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-17 19:21:43,605 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-17 19:21:43,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:21:44,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:21:44,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:21:44,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:44,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 19:21:44,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 11 proven. 128 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:21:44,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:21:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 77 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 19:21:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256304174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:21:44,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:21:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 10] total 39 [2025-03-17 19:21:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932318442] [2025-03-17 19:21:44,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:21:44,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 19:21:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 19:21:44,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 19:21:44,883 INFO L87 Difference]: Start difference. First operand 2760 states and 3821 transitions. Second operand has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 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-17 19:21:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:46,869 INFO L93 Difference]: Finished difference Result 5536 states and 7729 transitions. [2025-03-17 19:21:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 19:21:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 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 144 [2025-03-17 19:21:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:46,876 INFO L225 Difference]: With dead ends: 5536 [2025-03-17 19:21:46,876 INFO L226 Difference]: Without dead ends: 2871 [2025-03-17 19:21:46,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=850, Invalid=4552, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 19:21:46,880 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 45 mSDsluCounter, 9641 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10126 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:46,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10126 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 19:21:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2025-03-17 19:21:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2819. [2025-03-17 19:21:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2717 states have (on average 1.3860875966139123) internal successors, (3766), 2728 states have internal predecessors, (3766), 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-17 19:21:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3881 transitions. [2025-03-17 19:21:46,964 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3881 transitions. Word has length 144 [2025-03-17 19:21:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:46,966 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3881 transitions. [2025-03-17 19:21:46,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.17948717948718) internal successors, (163), 39 states have internal predecessors, (163), 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-17 19:21:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3881 transitions. [2025-03-17 19:21:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 19:21:46,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:46,967 INFO L218 NwaCegarLoop]: trace histogram [28, 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] [2025-03-17 19:21:46,978 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-17 19:21:47,167 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-17 19:21:47,168 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-17 19:21:47,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:47,169 INFO L85 PathProgramCache]: Analyzing trace with hash 250755653, now seen corresponding path program 3 times [2025-03-17 19:21:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160178145] [2025-03-17 19:21:47,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:21:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:47,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 11 equivalence classes. [2025-03-17 19:21:47,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 106 of 157 statements. [2025-03-17 19:21:47,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:21:47,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:21:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160178145] [2025-03-17 19:21:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160178145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:47,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:21:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60343265] [2025-03-17 19:21:47,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:47,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:47,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:47,510 INFO L87 Difference]: Start difference. First operand 2819 states and 3881 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-17 19:21:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:47,698 INFO L93 Difference]: Finished difference Result 5594 states and 7712 transitions. [2025-03-17 19:21:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:47,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 157 [2025-03-17 19:21:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:47,707 INFO L225 Difference]: With dead ends: 5594 [2025-03-17 19:21:47,707 INFO L226 Difference]: Without dead ends: 2819 [2025-03-17 19:21:47,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:47,710 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 17 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:47,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1343 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2025-03-17 19:21:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2819. [2025-03-17 19:21:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2717 states have (on average 1.3835112256164888) internal successors, (3759), 2728 states have internal predecessors, (3759), 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-17 19:21:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3874 transitions. [2025-03-17 19:21:47,799 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3874 transitions. Word has length 157 [2025-03-17 19:21:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:47,799 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3874 transitions. [2025-03-17 19:21:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-17 19:21:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3874 transitions. [2025-03-17 19:21:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 19:21:47,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:47,801 INFO L218 NwaCegarLoop]: trace histogram [28, 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-17 19:21:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 19:21:47,801 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-17 19:21:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1918035544, now seen corresponding path program 1 times [2025-03-17 19:21:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162533944] [2025-03-17 19:21:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:47,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 19:21:47,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 19:21:47,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:47,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:21:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162533944] [2025-03-17 19:21:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162533944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:21:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348942947] [2025-03-17 19:21:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:21:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:48,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:21:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:21:48,204 INFO L87 Difference]: Start difference. First operand 2819 states and 3874 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-17 19:21:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:48,465 INFO L93 Difference]: Finished difference Result 5612 states and 7729 transitions. [2025-03-17 19:21:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:21:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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 158 [2025-03-17 19:21:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:48,473 INFO L225 Difference]: With dead ends: 5612 [2025-03-17 19:21:48,473 INFO L226 Difference]: Without dead ends: 2840 [2025-03-17 19:21:48,476 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-17 19:21:48,477 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 8 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1766 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-17 19:21:48,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1766 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2025-03-17 19:21:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2025-03-17 19:21:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2738 states have (on average 1.3805697589481374) internal successors, (3780), 2749 states have internal predecessors, (3780), 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-17 19:21:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3895 transitions. [2025-03-17 19:21:48,572 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3895 transitions. Word has length 158 [2025-03-17 19:21:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:48,572 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 3895 transitions. [2025-03-17 19:21:48,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-17 19:21:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3895 transitions. [2025-03-17 19:21:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 19:21:48,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:48,574 INFO L218 NwaCegarLoop]: trace histogram [28, 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-17 19:21:48,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 19:21:48,574 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-17 19:21:48,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 47309153, now seen corresponding path program 1 times [2025-03-17 19:21:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595312014] [2025-03-17 19:21:48,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:48,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:21:48,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:21:48,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:48,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 19:21:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595312014] [2025-03-17 19:21:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595312014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:21:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124602822] [2025-03-17 19:21:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:21:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:48,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:21:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:21:48,950 INFO L87 Difference]: Start difference. First operand 2840 states and 3895 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-17 19:21:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:49,275 INFO L93 Difference]: Finished difference Result 5658 states and 7778 transitions. [2025-03-17 19:21:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:21:49,276 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), 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 159 [2025-03-17 19:21:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:49,282 INFO L225 Difference]: With dead ends: 5658 [2025-03-17 19:21:49,282 INFO L226 Difference]: Without dead ends: 2875 [2025-03-17 19:21:49,285 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-17 19:21:49,287 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 12 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:49,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2576 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:21:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2025-03-17 19:21:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2868. [2025-03-17 19:21:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2766 states have (on average 1.3792480115690529) internal successors, (3815), 2777 states have internal predecessors, (3815), 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-17 19:21:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 3930 transitions. [2025-03-17 19:21:49,371 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 3930 transitions. Word has length 159 [2025-03-17 19:21:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 2868 states and 3930 transitions. [2025-03-17 19:21:49,372 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), 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-17 19:21:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 3930 transitions. [2025-03-17 19:21:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 19:21:49,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:49,373 INFO L218 NwaCegarLoop]: trace histogram [28, 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-17 19:21:49,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 19:21:49,373 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-17 19:21:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1586856877, now seen corresponding path program 1 times [2025-03-17 19:21:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529853360] [2025-03-17 19:21:49,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:49,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:21:49,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:21:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 7 proven. 286 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-17 19:21:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529853360] [2025-03-17 19:21:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529853360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705923464] [2025-03-17 19:21:50,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:50,270 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-17 19:21:50,272 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-17 19:21:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 19:21:51,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:21:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:51,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 324 conjuncts are in the unsatisfiable core [2025-03-17 19:21:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:51,818 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-17 19:21:51,848 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-17 19:21:51,913 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-17 19:21:51,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 19:21:52,221 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 7 treesize of output 3 [2025-03-17 19:21:52,429 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 19:21:52,430 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-17 19:21:52,473 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-17 19:21:52,480 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 15 treesize of output 1 [2025-03-17 19:21:52,560 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 18 treesize of output 10 [2025-03-17 19:21:52,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:21:53,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:21:53,055 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 19:21:53,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:21:53,122 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2411 treesize of output 2030 [2025-03-17 19:21:53,144 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2025-03-17 19:21:53,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1384 treesize of output 1087 [2025-03-17 19:21:53,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:21:53,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 8 [2025-03-17 19:21:53,179 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2618 treesize of output 2205 [2025-03-17 19:21:53,202 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2592 treesize of output 2185 [2025-03-17 19:21:53,220 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:21:53,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1358 treesize of output 1 [2025-03-17 19:21:53,233 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2385 treesize of output 2010 [2025-03-17 19:21:53,294 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2411 treesize of output 2030 [2025-03-17 19:21:53,304 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:21:53,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1384 treesize of output 1 [2025-03-17 19:21:53,319 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2618 treesize of output 2205 [2025-03-17 19:21:53,338 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2256 treesize of output 1915 [2025-03-17 19:21:53,359 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-03-17 19:21:53,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 2049 treesize of output 1740 [2025-03-17 19:21:53,371 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-03-17 19:21:53,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1170 treesize of output 1 [2025-03-17 19:21:53,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:21:53,559 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 19:21:53,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 19:21:53,640 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:21:53,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 73 [2025-03-17 19:21:53,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:21:53,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:21:53,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2025-03-17 19:21:53,696 INFO L349 Elim1Store]: treesize reduction 137, result has 9.9 percent of original size [2025-03-17 19:21:53,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 148 [2025-03-17 19:21:53,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:21:53,715 INFO L349 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2025-03-17 19:21:53,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 64 [2025-03-17 19:22:39,141 INFO L349 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2025-03-17 19:22:39,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 136 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 233 [2025-03-17 19:22:39,189 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-03-17 19:22:39,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 140 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 290 [2025-03-17 19:22:42,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:22:42,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:42,363 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-17 19:22:42,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 136 disjoint index pairs (out of 190 index pairs), introduced 22 new quantified variables, introduced 190 case distinctions, treesize of input 636 treesize of output 382 [2025-03-17 19:22:42,419 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-03-17 19:22:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 139 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 1 case distinctions, treesize of input 313 treesize of output 357 [2025-03-17 19:22:45,791 INFO L349 Elim1Store]: treesize reduction 86, result has 5.5 percent of original size [2025-03-17 19:22:45,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 687 treesize of output 337 [2025-03-17 19:22:45,806 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 19:22:45,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 215 [2025-03-17 19:22:45,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 139 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 235 [2025-03-17 19:22:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:22:45,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 123 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 58