./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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 ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:01:39,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:01:39,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:01:39,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:01:39,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:01:39,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:01:39,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:01:39,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:01:39,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:01:39,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:01:39,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:01:39,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:01:39,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:01:39,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:01:39,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:01:39,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:01:39,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:01:39,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:01:39,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:01:39,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:01:39,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:01:39,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:01:39,709 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2025-03-04 15:01:39,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:01:39,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:01:39,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:01:39,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:01:39,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:01:39,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-03-04 15:01:41,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a10c426/381941eb06204ab49877a2bdfc5cdf0c/FLAG6b70b3ab5 [2025-03-04 15:01:41,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:01:41,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-03-04 15:01:41,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a10c426/381941eb06204ab49877a2bdfc5cdf0c/FLAG6b70b3ab5 [2025-03-04 15:01:41,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a10c426/381941eb06204ab49877a2bdfc5cdf0c [2025-03-04 15:01:41,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:01:41,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:01:41,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:01:41,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:01:41,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:01:41,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:41" (1/1) ... [2025-03-04 15:01:41,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@983cdb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:41, skipping insertion in model container [2025-03-04 15:01:41,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:41" (1/1) ... [2025-03-04 15:01:41,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:01:42,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:01:42,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:01:42,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:01:42,156 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:01:42,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42 WrapperNode [2025-03-04 15:01:42,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:01:42,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:01:42,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:01:42,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:01:42,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,220 INFO L138 Inliner]: procedures = 282, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2025-03-04 15:01:42,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:01:42,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:01:42,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:01:42,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:01:42,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,291 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 220, 12, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 49, 1, 4]. [2025-03-04 15:01:42,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:01:42,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:01:42,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:01:42,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:01:42,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (1/1) ... [2025-03-04 15:01:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:01:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:42,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:01:42,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:01:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 15:01:42,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 15:01:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-04 15:01:42,391 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:01:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 15:01:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-04 15:01:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-04 15:01:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:01:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:01:42,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:01:42,570 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:01:42,571 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:01:42,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-04 15:01:43,616 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-04 15:01:43,616 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-04 15:01:43,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 15:01:43,705 INFO L? ?]: Removed 345 outVars from TransFormulas that were not future-live. [2025-03-04 15:01:43,705 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:01:43,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:01:43,753 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 15:01:43,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:43 BoogieIcfgContainer [2025-03-04 15:01:43,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:01:43,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:01:43,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:01:43,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:01:43,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:01:41" (1/3) ... [2025-03-04 15:01:43,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1009ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:43, skipping insertion in model container [2025-03-04 15:01:43,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:42" (2/3) ... [2025-03-04 15:01:43,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1009ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:43, skipping insertion in model container [2025-03-04 15:01:43,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:43" (3/3) ... [2025-03-04 15:01:43,762 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2025-03-04 15:01:43,773 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:01:43,775 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-1.i that has 6 procedures, 457 locations, 1 initial locations, 34 loop locations, and 14 error locations. [2025-03-04 15:01:43,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:01:43,842 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;@554e7f80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:01:43,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 15:01:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 420 states have (on average 1.6023809523809525) internal successors, (673), 437 states have internal predecessors, (673), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 15:01:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 15:01:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:43,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:43,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash -945499652, now seen corresponding path program 1 times [2025-03-04 15:01:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192979426] [2025-03-04 15:01:43,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:01:43,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:01:43,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192979426] [2025-03-04 15:01:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192979426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:44,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:44,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:01:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106642244] [2025-03-04 15:01:44,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:44,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:01:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:44,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:01:44,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:01:44,027 INFO L87 Difference]: Start difference. First operand has 457 states, 420 states have (on average 1.6023809523809525) internal successors, (673), 437 states have internal predecessors, (673), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:44,137 INFO L93 Difference]: Finished difference Result 907 states and 1421 transitions. [2025-03-04 15:01:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:01:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 15:01:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:44,146 INFO L225 Difference]: With dead ends: 907 [2025-03-04 15:01:44,146 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 15:01:44,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:01:44,150 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:44,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 15:01:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-04 15:01:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 410 states have (on average 1.4536585365853658) internal successors, (596), 424 states have internal predecessors, (596), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 15:01:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 616 transitions. [2025-03-04 15:01:44,209 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 616 transitions. Word has length 8 [2025-03-04 15:01:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:44,209 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 616 transitions. [2025-03-04 15:01:44,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 616 transitions. [2025-03-04 15:01:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 15:01:44,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:44,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:44,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:01:44,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:44,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -945498691, now seen corresponding path program 1 times [2025-03-04 15:01:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041569984] [2025-03-04 15:01:44,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:44,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:01:44,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:01:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:44,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:01:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794441157] [2025-03-04 15:01:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:44,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:44,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:01:44,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:01:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:01:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:44,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:44,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:01:44,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:44,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:01:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:44,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:01:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:44,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041569984] [2025-03-04 15:01:44,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:01:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794441157] [2025-03-04 15:01:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794441157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:01:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185844601] [2025-03-04 15:01:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:44,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:01:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:44,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:01:44,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:01:44,439 INFO L87 Difference]: Start difference. First operand 438 states and 616 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:44,692 INFO L93 Difference]: Finished difference Result 842 states and 1199 transitions. [2025-03-04 15:01:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:01:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 15:01:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:44,697 INFO L225 Difference]: With dead ends: 842 [2025-03-04 15:01:44,697 INFO L226 Difference]: Without dead ends: 840 [2025-03-04 15:01:44,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:01:44,699 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 557 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:44,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1724 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:01:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-04 15:01:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 445. [2025-03-04 15:01:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 417 states have (on average 1.4484412470023982) internal successors, (604), 431 states have internal predecessors, (604), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 15:01:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 624 transitions. [2025-03-04 15:01:44,723 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 624 transitions. Word has length 8 [2025-03-04 15:01:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:44,723 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 624 transitions. [2025-03-04 15:01:44,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 624 transitions. [2025-03-04 15:01:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 15:01:44,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:44,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:44,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:01:44,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:44,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1620078048, now seen corresponding path program 1 times [2025-03-04 15:01:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460318742] [2025-03-04 15:01:44,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:01:44,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:01:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460318742] [2025-03-04 15:01:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460318742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:01:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309164654] [2025-03-04 15:01:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:01:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:45,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:01:45,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:01:45,217 INFO L87 Difference]: Start difference. First operand 445 states and 624 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:45,375 INFO L93 Difference]: Finished difference Result 839 states and 1172 transitions. [2025-03-04 15:01:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:01:45,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 15:01:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:45,378 INFO L225 Difference]: With dead ends: 839 [2025-03-04 15:01:45,379 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 15:01:45,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:01:45,380 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 30 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:45,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1427 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 15:01:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 15:01:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 375 states have (on average 1.4053333333333333) internal successors, (527), 389 states have internal predecessors, (527), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 15:01:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 547 transitions. [2025-03-04 15:01:45,398 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 547 transitions. Word has length 62 [2025-03-04 15:01:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 547 transitions. [2025-03-04 15:01:45,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 547 transitions. [2025-03-04 15:01:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 15:01:45,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:45,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:01:45,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1726730970, now seen corresponding path program 1 times [2025-03-04 15:01:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466577682] [2025-03-04 15:01:45,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:45,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:01:45,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:01:45,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:45,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466577682] [2025-03-04 15:01:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466577682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:01:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881023554] [2025-03-04 15:01:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:01:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:45,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:01:45,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:01:45,640 INFO L87 Difference]: Start difference. First operand 403 states and 547 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:45,762 INFO L93 Difference]: Finished difference Result 727 states and 997 transitions. [2025-03-04 15:01:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:01:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 15:01:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:45,769 INFO L225 Difference]: With dead ends: 727 [2025-03-04 15:01:45,769 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 15:01:45,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:01:45,771 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 378 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:45,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1478 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 15:01:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 715. [2025-03-04 15:01:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 684 states have (on average 1.4137426900584795) internal successors, (967), 699 states have internal predecessors, (967), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 15:01:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 993 transitions. [2025-03-04 15:01:45,793 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 993 transitions. Word has length 62 [2025-03-04 15:01:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 993 transitions. [2025-03-04 15:01:45,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 993 transitions. [2025-03-04 15:01:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 15:01:45,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:45,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:01:45,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2053430496, now seen corresponding path program 1 times [2025-03-04 15:01:45,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:45,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322549891] [2025-03-04 15:01:45,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:45,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:45,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:01:45,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:01:45,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:45,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322549891] [2025-03-04 15:01:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322549891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:45,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:01:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676672365] [2025-03-04 15:01:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:45,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:01:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:01:45,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:01:45,977 INFO L87 Difference]: Start difference. First operand 715 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:46,150 INFO L93 Difference]: Finished difference Result 1675 states and 2370 transitions. [2025-03-04 15:01:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:01:46,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-04 15:01:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:46,155 INFO L225 Difference]: With dead ends: 1675 [2025-03-04 15:01:46,155 INFO L226 Difference]: Without dead ends: 1279 [2025-03-04 15:01:46,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:01:46,157 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 476 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:46,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1440 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-03-04 15:01:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 715. [2025-03-04 15:01:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 684 states have (on average 1.412280701754386) internal successors, (966), 699 states have internal predecessors, (966), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 15:01:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 992 transitions. [2025-03-04 15:01:46,179 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 992 transitions. Word has length 68 [2025-03-04 15:01:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 992 transitions. [2025-03-04 15:01:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 992 transitions. [2025-03-04 15:01:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 15:01:46,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:01:46,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 385671518, now seen corresponding path program 1 times [2025-03-04 15:01:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098015412] [2025-03-04 15:01:46,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:46,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:01:46,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:01:46,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:46,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:46,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098015412] [2025-03-04 15:01:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098015412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:46,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:46,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:01:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775503749] [2025-03-04 15:01:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:46,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:01:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:46,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:01:46,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:01:46,346 INFO L87 Difference]: Start difference. First operand 715 states and 992 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 15:01:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:46,436 INFO L93 Difference]: Finished difference Result 943 states and 1304 transitions. [2025-03-04 15:01:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:01:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-03-04 15:01:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:46,440 INFO L225 Difference]: With dead ends: 943 [2025-03-04 15:01:46,440 INFO L226 Difference]: Without dead ends: 941 [2025-03-04 15:01:46,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:01:46,442 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 404 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:46,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 992 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-04 15:01:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 931. [2025-03-04 15:01:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 892 states have (on average 1.4192825112107623) internal successors, (1266), 908 states have internal predecessors, (1266), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 15:01:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1302 transitions. [2025-03-04 15:01:46,469 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1302 transitions. Word has length 72 [2025-03-04 15:01:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:46,470 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1302 transitions. [2025-03-04 15:01:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 15:01:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1302 transitions. [2025-03-04 15:01:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 15:01:46,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:46,471 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:01:46,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -679971364, now seen corresponding path program 1 times [2025-03-04 15:01:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980843410] [2025-03-04 15:01:46,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:46,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 15:01:46,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:01:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980843410] [2025-03-04 15:01:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980843410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881573346] [2025-03-04 15:01:46,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:46,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:46,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:46,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:01:46,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 15:01:46,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:01:46,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:46,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:46,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:01:46,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:47,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:01:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881573346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:01:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-04 15:01:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629752629] [2025-03-04 15:01:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:01:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:47,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:01:47,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:01:47,027 INFO L87 Difference]: Start difference. First operand 931 states and 1302 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 15:01:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:47,191 INFO L93 Difference]: Finished difference Result 1253 states and 1750 transitions. [2025-03-04 15:01:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:01:47,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2025-03-04 15:01:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:47,196 INFO L225 Difference]: With dead ends: 1253 [2025-03-04 15:01:47,196 INFO L226 Difference]: Without dead ends: 1252 [2025-03-04 15:01:47,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:01:47,198 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 498 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:47,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1892 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-04 15:01:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1050. [2025-03-04 15:01:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1009 states have (on average 1.4122893954410307) internal successors, (1425), 1026 states have internal predecessors, (1425), 20 states have call successors, (20), 10 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 15:01:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1465 transitions. [2025-03-04 15:01:47,230 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1465 transitions. Word has length 81 [2025-03-04 15:01:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1465 transitions. [2025-03-04 15:01:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 15:01:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1465 transitions. [2025-03-04 15:01:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 15:01:47,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:47,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:47,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:01:47,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 15:01:47,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 395724174, now seen corresponding path program 1 times [2025-03-04 15:01:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899412480] [2025-03-04 15:01:47,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:47,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 15:01:47,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 15:01:47,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:47,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899412480] [2025-03-04 15:01:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899412480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378356479] [2025-03-04 15:01:47,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:47,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:47,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:01:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 15:01:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 15:01:47,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:47,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:01:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:48,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:01:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378356479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:01:48,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:01:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-04 15:01:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681926512] [2025-03-04 15:01:48,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:01:48,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:01:48,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:48,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:01:48,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:01:48,206 INFO L87 Difference]: Start difference. First operand 1050 states and 1465 transitions. Second operand has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 15:01:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:49,258 INFO L93 Difference]: Finished difference Result 2823 states and 3921 transitions. [2025-03-04 15:01:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:01:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 82 [2025-03-04 15:01:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:49,268 INFO L225 Difference]: With dead ends: 2823 [2025-03-04 15:01:49,268 INFO L226 Difference]: Without dead ends: 2821 [2025-03-04 15:01:49,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 15:01:49,270 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 4024 mSDsluCounter, 6824 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4034 SdHoareTripleChecker+Valid, 7376 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:49,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4034 Valid, 7376 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 15:01:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-03-04 15:01:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2338. [2025-03-04 15:01:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2250 states have (on average 1.3946666666666667) internal successors, (3138), 2269 states have internal predecessors, (3138), 56 states have call successors, (56), 23 states have call predecessors, (56), 18 states have return successors, (79), 45 states have call predecessors, (79), 56 states have call successors, (79) [2025-03-04 15:01:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3273 transitions. [2025-03-04 15:01:49,337 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3273 transitions. Word has length 82 [2025-03-04 15:01:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3273 transitions. [2025-03-04 15:01:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 12.882352941176471) internal successors, (219), 15 states have internal predecessors, (219), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 15:01:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3273 transitions. [2025-03-04 15:01:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 15:01:49,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:49,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:49,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:01:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:49,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 734834845, now seen corresponding path program 1 times [2025-03-04 15:01:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658031423] [2025-03-04 15:01:49,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:49,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:01:49,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:01:49,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:49,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658031423] [2025-03-04 15:01:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658031423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:01:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881561378] [2025-03-04 15:01:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:01:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:49,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:01:49,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:01:49,626 INFO L87 Difference]: Start difference. First operand 2338 states and 3273 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:49,787 INFO L93 Difference]: Finished difference Result 4733 states and 6646 transitions. [2025-03-04 15:01:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:01:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 15:01:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:49,795 INFO L225 Difference]: With dead ends: 4733 [2025-03-04 15:01:49,795 INFO L226 Difference]: Without dead ends: 2404 [2025-03-04 15:01:49,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:01:49,799 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 296 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:49,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1139 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-03-04 15:01:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2393. [2025-03-04 15:01:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2312 states have (on average 1.4031141868512111) internal successors, (3244), 2330 states have internal predecessors, (3244), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-04 15:01:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3366 transitions. [2025-03-04 15:01:49,877 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3366 transitions. Word has length 80 [2025-03-04 15:01:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:49,877 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3366 transitions. [2025-03-04 15:01:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:01:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3366 transitions. [2025-03-04 15:01:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 15:01:49,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:49,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:01:49,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 151452928, now seen corresponding path program 1 times [2025-03-04 15:01:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499860024] [2025-03-04 15:01:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 15:01:49,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 15:01:49,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:50,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499860024] [2025-03-04 15:01:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499860024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:50,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040718991] [2025-03-04 15:01:50,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:50,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:50,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:01:50,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 15:01:50,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 15:01:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:50,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:01:50,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:50,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:01:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040718991] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:01:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 12 [2025-03-04 15:01:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303129373] [2025-03-04 15:01:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:01:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:50,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:01:50,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:01:50,611 INFO L87 Difference]: Start difference. First operand 2393 states and 3366 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:01:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:50,712 INFO L93 Difference]: Finished difference Result 2393 states and 3366 transitions. [2025-03-04 15:01:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:01:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 91 [2025-03-04 15:01:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:50,724 INFO L225 Difference]: With dead ends: 2393 [2025-03-04 15:01:50,724 INFO L226 Difference]: Without dead ends: 2392 [2025-03-04 15:01:50,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:01:50,726 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:50,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 496 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-04 15:01:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2025-03-04 15:01:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2312 states have (on average 1.4009515570934257) internal successors, (3239), 2329 states have internal predecessors, (3239), 50 states have call successors, (50), 21 states have call predecessors, (50), 17 states have return successors, (72), 41 states have call predecessors, (72), 50 states have call successors, (72) [2025-03-04 15:01:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3361 transitions. [2025-03-04 15:01:50,789 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3361 transitions. Word has length 91 [2025-03-04 15:01:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3361 transitions. [2025-03-04 15:01:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:01:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3361 transitions. [2025-03-04 15:01:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 15:01:50,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:50,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:50,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:01:50,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:50,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:50,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash 400073469, now seen corresponding path program 1 times [2025-03-04 15:01:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836868646] [2025-03-04 15:01:50,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:01:51,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:01:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:51,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836868646] [2025-03-04 15:01:51,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836868646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:51,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344901430] [2025-03-04 15:01:51,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:51,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:51,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:51,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:51,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:01:51,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:01:51,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:01:51,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:51,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:01:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:51,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:01:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344901430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:01:51,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:01:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-04 15:01:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976089808] [2025-03-04 15:01:51,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:01:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:01:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:01:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:01:51,656 INFO L87 Difference]: Start difference. First operand 2392 states and 3361 transitions. Second operand has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 15:01:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:52,209 INFO L93 Difference]: Finished difference Result 4749 states and 6675 transitions. [2025-03-04 15:01:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:01:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 92 [2025-03-04 15:01:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:52,224 INFO L225 Difference]: With dead ends: 4749 [2025-03-04 15:01:52,224 INFO L226 Difference]: Without dead ends: 4748 [2025-03-04 15:01:52,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:01:52,226 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1668 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:52,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 3457 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:01:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-03-04 15:01:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4369. [2025-03-04 15:01:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 4213 states have (on average 1.3999525278898648) internal successors, (5898), 4233 states have internal predecessors, (5898), 99 states have call successors, (99), 50 states have call predecessors, (99), 44 states have return successors, (137), 85 states have call predecessors, (137), 99 states have call successors, (137) [2025-03-04 15:01:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6134 transitions. [2025-03-04 15:01:52,324 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6134 transitions. Word has length 92 [2025-03-04 15:01:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:52,324 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6134 transitions. [2025-03-04 15:01:52,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 19.25) internal successors, (231), 13 states have internal predecessors, (231), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 15:01:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6134 transitions. [2025-03-04 15:01:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 15:01:52,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:52,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:52,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:01:52,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:01:52,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:52,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1897149704, now seen corresponding path program 1 times [2025-03-04 15:01:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259991789] [2025-03-04 15:01:52,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 15:01:52,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 15:01:52,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:52,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:01:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259991789] [2025-03-04 15:01:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259991789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:01:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:01:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380736467] [2025-03-04 15:01:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:01:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:01:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:01:52,790 INFO L87 Difference]: Start difference. First operand 4369 states and 6134 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:01:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:53,007 INFO L93 Difference]: Finished difference Result 5891 states and 8329 transitions. [2025-03-04 15:01:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:01:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 118 [2025-03-04 15:01:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:53,045 INFO L225 Difference]: With dead ends: 5891 [2025-03-04 15:01:53,046 INFO L226 Difference]: Without dead ends: 5889 [2025-03-04 15:01:53,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:01:53,047 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 390 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:53,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1418 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:01:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5889 states. [2025-03-04 15:01:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5889 to 4535. [2025-03-04 15:01:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4370 states have (on average 1.3945080091533182) internal successors, (6094), 4391 states have internal predecessors, (6094), 108 states have call successors, (108), 50 states have call predecessors, (108), 44 states have return successors, (149), 93 states have call predecessors, (149), 108 states have call successors, (149) [2025-03-04 15:01:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6351 transitions. [2025-03-04 15:01:53,162 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6351 transitions. Word has length 118 [2025-03-04 15:01:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:53,162 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6351 transitions. [2025-03-04 15:01:53,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:01:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6351 transitions. [2025-03-04 15:01:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 15:01:53,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:53,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:53,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:01:53,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:53,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash 783839923, now seen corresponding path program 1 times [2025-03-04 15:01:53,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:53,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664176313] [2025-03-04 15:01:53,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:53,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:53,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 15:01:53,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 15:01:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664176313] [2025-03-04 15:01:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664176313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720419148] [2025-03-04 15:01:53,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:53,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:53,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:01:53,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 15:01:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 15:01:53,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:53,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:01:53,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:01:53,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:01:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720419148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:01:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-04 15:01:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75956979] [2025-03-04 15:01:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:01:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:53,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:01:53,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:01:53,830 INFO L87 Difference]: Start difference. First operand 4535 states and 6351 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:01:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:54,113 INFO L93 Difference]: Finished difference Result 8548 states and 12022 transitions. [2025-03-04 15:01:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:01:54,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2025-03-04 15:01:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:54,133 INFO L225 Difference]: With dead ends: 8548 [2025-03-04 15:01:54,133 INFO L226 Difference]: Without dead ends: 4329 [2025-03-04 15:01:54,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:01:54,140 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 85 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:54,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2780 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:01:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2025-03-04 15:01:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 4329. [2025-03-04 15:01:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4329 states, 4181 states have (on average 1.3996651518775411) internal successors, (5852), 4200 states have internal predecessors, (5852), 97 states have call successors, (97), 44 states have call predecessors, (97), 38 states have return successors, (132), 84 states have call predecessors, (132), 97 states have call successors, (132) [2025-03-04 15:01:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 6081 transitions. [2025-03-04 15:01:54,247 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 6081 transitions. Word has length 125 [2025-03-04 15:01:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:54,247 INFO L471 AbstractCegarLoop]: Abstraction has 4329 states and 6081 transitions. [2025-03-04 15:01:54,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:01:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 6081 transitions. [2025-03-04 15:01:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 15:01:54,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:54,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:54,256 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-04 15:01:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:54,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:54,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 432839929, now seen corresponding path program 1 times [2025-03-04 15:01:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205873324] [2025-03-04 15:01:54,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:54,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 15:01:54,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 15:01:54,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:54,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:01:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205873324] [2025-03-04 15:01:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205873324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051164080] [2025-03-04 15:01:54,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:54,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:01:55,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 15:01:55,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 15:01:55,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:55,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:55,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:01:55,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:01:55,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:01:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051164080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:55,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:01:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 11 [2025-03-04 15:01:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793073368] [2025-03-04 15:01:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:01:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:01:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:01:55,271 INFO L87 Difference]: Start difference. First operand 4329 states and 6081 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 15:01:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:55,538 INFO L93 Difference]: Finished difference Result 6945 states and 9752 transitions. [2025-03-04 15:01:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:01:55,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 130 [2025-03-04 15:01:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:55,545 INFO L225 Difference]: With dead ends: 6945 [2025-03-04 15:01:55,545 INFO L226 Difference]: Without dead ends: 2699 [2025-03-04 15:01:55,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:01:55,551 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 13 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3888 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:55,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3888 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:01:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2025-03-04 15:01:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2025-03-04 15:01:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2595 states have (on average 1.3992292870905587) internal successors, (3631), 2611 states have internal predecessors, (3631), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (65), 47 states have call predecessors, (65), 54 states have call successors, (65) [2025-03-04 15:01:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3750 transitions. [2025-03-04 15:01:55,609 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3750 transitions. Word has length 130 [2025-03-04 15:01:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:55,609 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3750 transitions. [2025-03-04 15:01:55,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 15:01:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3750 transitions. [2025-03-04 15:01:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 15:01:55,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:55,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:55,621 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-04 15:01:55,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:55,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 230720251, now seen corresponding path program 1 times [2025-03-04 15:01:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681057944] [2025-03-04 15:01:55,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:55,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 15:01:55,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 15:01:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:01:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681057944] [2025-03-04 15:01:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681057944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562567580] [2025-03-04 15:01:56,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:56,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:56,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:01:56,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 15:01:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 15:01:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:56,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:01:56,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:56,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:01:56,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:01:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 15:01:56,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:01:56,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-04 15:01:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:01:57,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:01:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562567580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:01:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:01:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 15:01:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96679700] [2025-03-04 15:01:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:01:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:01:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:01:57,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:01:57,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:01:57,009 INFO L87 Difference]: Start difference. First operand 2697 states and 3750 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:01:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:01:57,925 INFO L93 Difference]: Finished difference Result 6267 states and 8774 transitions. [2025-03-04 15:01:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:01:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 132 [2025-03-04 15:01:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:01:57,933 INFO L225 Difference]: With dead ends: 6267 [2025-03-04 15:01:57,933 INFO L226 Difference]: Without dead ends: 3615 [2025-03-04 15:01:57,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:01:57,938 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 612 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 15:01:57,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2610 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 15:01:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-03-04 15:01:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2697. [2025-03-04 15:01:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2595 states have (on average 1.3988439306358382) internal successors, (3630), 2611 states have internal predecessors, (3630), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (65), 47 states have call predecessors, (65), 54 states have call successors, (65) [2025-03-04 15:01:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3749 transitions. [2025-03-04 15:01:57,996 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3749 transitions. Word has length 132 [2025-03-04 15:01:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:01:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3749 transitions. [2025-03-04 15:01:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:01:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3749 transitions. [2025-03-04 15:01:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 15:01:57,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:01:57,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:01:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:01:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:01:58,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:01:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:01:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1063136397, now seen corresponding path program 1 times [2025-03-04 15:01:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:01:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134074961] [2025-03-04 15:01:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:01:58,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 15:01:58,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 15:01:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:01:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:01:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134074961] [2025-03-04 15:01:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134074961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:01:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500740793] [2025-03-04 15:01:58,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:01:58,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:01:58,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:01:58,545 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:01:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:01:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 15:01:58,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 15:01:58,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:01:58,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:01:58,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 15:01:58,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:01:58,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:01:58,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:01:58,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 15:02:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:02:01,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500740793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2025-03-04 15:02:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637203375] [2025-03-04 15:02:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:01,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:02:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:02:01,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:02:01,711 INFO L87 Difference]: Start difference. First operand 2697 states and 3749 transitions. Second operand has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:03,316 INFO L93 Difference]: Finished difference Result 6267 states and 8773 transitions. [2025-03-04 15:02:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:02:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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 133 [2025-03-04 15:02:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:03,324 INFO L225 Difference]: With dead ends: 6267 [2025-03-04 15:02:03,324 INFO L226 Difference]: Without dead ends: 3615 [2025-03-04 15:02:03,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:02:03,328 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 591 mSDsluCounter, 3638 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 4117 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:03,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 4117 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 15:02:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-03-04 15:02:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2697. [2025-03-04 15:02:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2595 states have (on average 1.3980732177263968) internal successors, (3628), 2611 states have internal predecessors, (3628), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (65), 47 states have call predecessors, (65), 54 states have call successors, (65) [2025-03-04 15:02:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3747 transitions. [2025-03-04 15:02:03,383 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3747 transitions. Word has length 133 [2025-03-04 15:02:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:03,383 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3747 transitions. [2025-03-04 15:02:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3747 transitions. [2025-03-04 15:02:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 15:02:03,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:03,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:03,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:02:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:02:03,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 328570688, now seen corresponding path program 1 times [2025-03-04 15:02:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153620454] [2025-03-04 15:02:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:03,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 15:02:03,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 15:02:03,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:03,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:02:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153620454] [2025-03-04 15:02:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153620454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309078502] [2025-03-04 15:02:03,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:03,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:03,899 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:03,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:02:04,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 15:02:04,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 15:02:04,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:04,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:04,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:02:04,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:02:04,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:02:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309078502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:02:04,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:02:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 17 [2025-03-04 15:02:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901056650] [2025-03-04 15:02:04,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:04,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:02:04,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:04,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:02:04,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:02:04,441 INFO L87 Difference]: Start difference. First operand 2697 states and 3747 transitions. Second operand has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:04,831 INFO L93 Difference]: Finished difference Result 5364 states and 7475 transitions. [2025-03-04 15:02:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:02:04,831 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 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-04 15:02:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:04,838 INFO L225 Difference]: With dead ends: 5364 [2025-03-04 15:02:04,838 INFO L226 Difference]: Without dead ends: 2759 [2025-03-04 15:02:04,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-04 15:02:04,842 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 28 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4872 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:02:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2025-03-04 15:02:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2737. [2025-03-04 15:02:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2634 states have (on average 1.3982536066818527) internal successors, (3683), 2647 states have internal predecessors, (3683), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 15:02:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3798 transitions. [2025-03-04 15:02:04,926 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3798 transitions. Word has length 135 [2025-03-04 15:02:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:04,927 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 3798 transitions. [2025-03-04 15:02:04,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3798 transitions. [2025-03-04 15:02:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 15:02:04,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:04,928 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:04,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:02:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:02:05,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -583534242, now seen corresponding path program 2 times [2025-03-04 15:02:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261632656] [2025-03-04 15:02:05,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:05,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-03-04 15:02:05,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 15:02:05,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:02:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:02:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261632656] [2025-03-04 15:02:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261632656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291826943] [2025-03-04 15:02:05,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:05,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:05,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:05,823 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:05,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:02:06,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-03-04 15:02:06,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 139 statements. [2025-03-04 15:02:06,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:02:06,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:06,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:02:06,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:06,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:02:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 15:02:06,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291826943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 15:02:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234819561] [2025-03-04 15:02:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:02:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:02:06,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:02:06,126 INFO L87 Difference]: Start difference. First operand 2737 states and 3798 transitions. Second operand has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:06,211 INFO L93 Difference]: Finished difference Result 2737 states and 3798 transitions. [2025-03-04 15:02:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:02:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 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 139 [2025-03-04 15:02:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:06,217 INFO L225 Difference]: With dead ends: 2737 [2025-03-04 15:02:06,217 INFO L226 Difference]: Without dead ends: 2736 [2025-03-04 15:02:06,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:02:06,219 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 1 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:06,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 988 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-04 15:02:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2736. [2025-03-04 15:02:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2634 states have (on average 1.3959757023538344) internal successors, (3677), 2646 states have internal predecessors, (3677), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 15:02:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3792 transitions. [2025-03-04 15:02:06,272 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3792 transitions. Word has length 139 [2025-03-04 15:02:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:06,272 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 3792 transitions. [2025-03-04 15:02:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3792 transitions. [2025-03-04 15:02:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 15:02:06,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:06,274 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:06,282 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-04 15:02:06,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:02:06,478 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -909691628, now seen corresponding path program 1 times [2025-03-04 15:02:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248704734] [2025-03-04 15:02:06,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:06,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 15:02:06,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 15:02:06,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:06,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:02:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248704734] [2025-03-04 15:02:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248704734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620761931] [2025-03-04 15:02:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:07,033 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:07,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:02:07,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 15:02:07,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 15:02:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:07,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:07,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:02:07,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:02:07,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:02:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620761931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:02:07,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:02:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 27 [2025-03-04 15:02:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034111981] [2025-03-04 15:02:07,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 15:02:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:07,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 15:02:07,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-04 15:02:07,863 INFO L87 Difference]: Start difference. First operand 2736 states and 3792 transitions. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:08,841 INFO L93 Difference]: Finished difference Result 5471 states and 7617 transitions. [2025-03-04 15:02:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:02:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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 140 [2025-03-04 15:02:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:08,848 INFO L225 Difference]: With dead ends: 5471 [2025-03-04 15:02:08,849 INFO L226 Difference]: Without dead ends: 2812 [2025-03-04 15:02:08,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 15:02:08,853 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 50 mSDsluCounter, 6167 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:08,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 6645 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:02:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-04 15:02:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2781. [2025-03-04 15:02:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2679 states have (on average 1.3904441955953715) internal successors, (3725), 2691 states have internal predecessors, (3725), 54 states have call successors, (54), 42 states have call predecessors, (54), 36 states have return successors, (61), 47 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-04 15:02:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3840 transitions. [2025-03-04 15:02:08,939 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3840 transitions. Word has length 140 [2025-03-04 15:02:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:08,939 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3840 transitions. [2025-03-04 15:02:08,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3840 transitions. [2025-03-04 15:02:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 15:02:08,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:08,941 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:08,949 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-04 15:02:09,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:09,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:09,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -182608021, now seen corresponding path program 2 times [2025-03-04 15:02:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:09,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632621903] [2025-03-04 15:02:09,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:09,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-04 15:02:09,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 15:02:09,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:02:09,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:02:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632621903] [2025-03-04 15:02:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632621903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087948930] [2025-03-04 15:02:09,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:09,883 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:02:10,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-04 15:02:10,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 15:02:10,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:02:10,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:10,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:02:10,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:10,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:02:10,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 15:02:10,662 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 29 treesize of output 13 [2025-03-04 15:02:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 15:02:10,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087948930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:18,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:02:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 22 [2025-03-04 15:02:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519785165] [2025-03-04 15:02:18,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:02:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:18,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:02:18,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=665, Unknown=1, NotChecked=0, Total=756 [2025-03-04 15:02:18,899 INFO L87 Difference]: Start difference. First operand 2781 states and 3840 transitions. Second operand has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 15:02:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:20,321 INFO L93 Difference]: Finished difference Result 6930 states and 9663 transitions. [2025-03-04 15:02:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 15:02:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 149 [2025-03-04 15:02:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:20,331 INFO L225 Difference]: With dead ends: 6930 [2025-03-04 15:02:20,331 INFO L226 Difference]: Without dead ends: 4250 [2025-03-04 15:02:20,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 161 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=170, Invalid=1551, Unknown=1, NotChecked=0, Total=1722 [2025-03-04 15:02:20,335 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 972 mSDsluCounter, 9484 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 10132 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:20,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 10132 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 15:02:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2025-03-04 15:02:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 3358. [2025-03-04 15:02:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3245 states have (on average 1.4012326656394454) internal successors, (4547), 3260 states have internal predecessors, (4547), 60 states have call successors, (60), 47 states have call predecessors, (60), 41 states have return successors, (67), 50 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-04 15:02:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4674 transitions. [2025-03-04 15:02:20,449 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4674 transitions. Word has length 149 [2025-03-04 15:02:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:20,449 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 4674 transitions. [2025-03-04 15:02:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 15:02:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4674 transitions. [2025-03-04 15:02:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 15:02:20,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:20,450 INFO L218 NwaCegarLoop]: trace histogram [22, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:20,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:02:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 15:02:20,651 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1321200308, now seen corresponding path program 1 times [2025-03-04 15:02:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622769746] [2025-03-04 15:02:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:20,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 15:02:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 15:02:20,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 15:02:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622769746] [2025-03-04 15:02:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622769746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472151365] [2025-03-04 15:02:21,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:21,195 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:21,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:02:21,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 15:02:21,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 15:02:21,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:21,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:21,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:02:21,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 194 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-04 15:02:21,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 15:02:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472151365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:02:21,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:02:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10] total 18 [2025-03-04 15:02:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318584198] [2025-03-04 15:02:21,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:02:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:21,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:02:21,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:02:21,870 INFO L87 Difference]: Start difference. First operand 3358 states and 4674 transitions. Second operand has 19 states, 18 states have (on average 10.38888888888889) internal successors, (187), 15 states have internal predecessors, (187), 7 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 15:02:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:22,549 INFO L93 Difference]: Finished difference Result 8790 states and 12554 transitions. [2025-03-04 15:02:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:02:22,549 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 10.38888888888889) internal successors, (187), 15 states have internal predecessors, (187), 7 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 169 [2025-03-04 15:02:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:22,563 INFO L225 Difference]: With dead ends: 8790 [2025-03-04 15:02:22,564 INFO L226 Difference]: Without dead ends: 6933 [2025-03-04 15:02:22,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2025-03-04 15:02:22,568 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 4720 mSDsluCounter, 5567 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4722 SdHoareTripleChecker+Valid, 6560 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:22,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4722 Valid, 6560 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:02:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6933 states. [2025-03-04 15:02:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6933 to 4387. [2025-03-04 15:02:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 4290 states have (on average 1.4272727272727272) internal successors, (6123), 4304 states have internal predecessors, (6123), 50 states have call successors, (50), 41 states have call predecessors, (50), 36 states have return successors, (51), 41 states have call predecessors, (51), 50 states have call successors, (51) [2025-03-04 15:02:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 6224 transitions. [2025-03-04 15:02:22,688 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 6224 transitions. Word has length 169 [2025-03-04 15:02:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:22,689 INFO L471 AbstractCegarLoop]: Abstraction has 4387 states and 6224 transitions. [2025-03-04 15:02:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 10.38888888888889) internal successors, (187), 15 states have internal predecessors, (187), 7 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 15:02:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 6224 transitions. [2025-03-04 15:02:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 15:02:22,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:22,691 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:22,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 15:02:22,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:22,892 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:22,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1470180509, now seen corresponding path program 1 times [2025-03-04 15:02:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:22,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685168103] [2025-03-04 15:02:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 15:02:22,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 15:02:22,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:22,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685168103] [2025-03-04 15:02:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685168103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:02:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688882049] [2025-03-04 15:02:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:23,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:02:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:23,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:02:23,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:02:23,086 INFO L87 Difference]: Start difference. First operand 4387 states and 6224 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:23,212 INFO L93 Difference]: Finished difference Result 5528 states and 7862 transitions. [2025-03-04 15:02:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:02:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 215 [2025-03-04 15:02:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:23,218 INFO L225 Difference]: With dead ends: 5528 [2025-03-04 15:02:23,218 INFO L226 Difference]: Without dead ends: 2139 [2025-03-04 15:02:23,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:02:23,227 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 19 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:23,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 965 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-04 15:02:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1946. [2025-03-04 15:02:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1865 states have (on average 1.3544235924932977) internal successors, (2526), 1878 states have internal predecessors, (2526), 39 states have call successors, (39), 35 states have call predecessors, (39), 32 states have return successors, (40), 32 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-04 15:02:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2605 transitions. [2025-03-04 15:02:23,278 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2605 transitions. Word has length 215 [2025-03-04 15:02:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2605 transitions. [2025-03-04 15:02:23,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2605 transitions. [2025-03-04 15:02:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-04 15:02:23,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:23,281 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:02:23,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:23,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -567472063, now seen corresponding path program 1 times [2025-03-04 15:02:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:23,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633550962] [2025-03-04 15:02:23,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:23,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 15:02:23,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 15:02:23,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:23,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633550962] [2025-03-04 15:02:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633550962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:23,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:23,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:02:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188040986] [2025-03-04 15:02:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:23,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:02:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:23,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:02:23,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:02:23,469 INFO L87 Difference]: Start difference. First operand 1946 states and 2605 transitions. Second operand has 3 states, 2 states have (on average 87.0) internal successors, (174), 3 states have internal predecessors, (174), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 15:02:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:23,574 INFO L93 Difference]: Finished difference Result 2259 states and 3063 transitions. [2025-03-04 15:02:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:02:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 87.0) internal successors, (174), 3 states have internal predecessors, (174), 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 217 [2025-03-04 15:02:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:23,579 INFO L225 Difference]: With dead ends: 2259 [2025-03-04 15:02:23,579 INFO L226 Difference]: Without dead ends: 2257 [2025-03-04 15:02:23,579 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-04 15:02:23,579 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 303 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:23,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 752 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-04 15:02:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2228. [2025-03-04 15:02:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2148 states have (on average 1.3705772811918064) internal successors, (2944), 2160 states have internal predecessors, (2944), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3021 transitions. [2025-03-04 15:02:23,632 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3021 transitions. Word has length 217 [2025-03-04 15:02:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3021 transitions. [2025-03-04 15:02:23,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 87.0) internal successors, (174), 3 states have internal predecessors, (174), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 15:02:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3021 transitions. [2025-03-04 15:02:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-04 15:02:23,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:23,635 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:23,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:02:23,635 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 563215008, now seen corresponding path program 1 times [2025-03-04 15:02:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:23,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217546173] [2025-03-04 15:02:23,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:23,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 15:02:23,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 15:02:23,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:23,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-04 15:02:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217546173] [2025-03-04 15:02:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217546173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687006817] [2025-03-04 15:02:24,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:24,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:24,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:24,373 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:02:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 15:02:24,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 15:02:24,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:24,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:24,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:02:24,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:24,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:02:25,032 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 17 treesize of output 9 [2025-03-04 15:02:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-04 15:02:25,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687006817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 15:02:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553360493] [2025-03-04 15:02:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:25,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:02:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:25,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:02:25,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:02:25,040 INFO L87 Difference]: Start difference. First operand 2228 states and 3021 transitions. Second operand has 5 states, 4 states have (on average 46.25) internal successors, (185), 5 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:25,203 INFO L93 Difference]: Finished difference Result 2396 states and 3243 transitions. [2025-03-04 15:02:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:02:25,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 46.25) internal successors, (185), 5 states have internal predecessors, (185), 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 227 [2025-03-04 15:02:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:25,208 INFO L225 Difference]: With dead ends: 2396 [2025-03-04 15:02:25,208 INFO L226 Difference]: Without dead ends: 2395 [2025-03-04 15:02:25,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:02:25,209 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 398 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:25,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1201 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2025-03-04 15:02:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2227. [2025-03-04 15:02:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2148 states have (on average 1.3682495344506518) internal successors, (2939), 2159 states have internal predecessors, (2939), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3016 transitions. [2025-03-04 15:02:25,264 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3016 transitions. Word has length 227 [2025-03-04 15:02:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:25,265 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 3016 transitions. [2025-03-04 15:02:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 46.25) internal successors, (185), 5 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3016 transitions. [2025-03-04 15:02:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 15:02:25,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:25,267 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:25,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:02:25,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:25,467 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -283305802, now seen corresponding path program 1 times [2025-03-04 15:02:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944767457] [2025-03-04 15:02:25,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:25,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 15:02:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 15:02:25,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:25,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944767457] [2025-03-04 15:02:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944767457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561849252] [2025-03-04 15:02:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:25,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:25,668 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:02:26,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 15:02:26,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 15:02:26,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:26,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:02:26,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-04 15:02:26,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561849252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-04 15:02:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189928045] [2025-03-04 15:02:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:02:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:26,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:02:26,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:02:26,203 INFO L87 Difference]: Start difference. First operand 2227 states and 3016 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:26,354 INFO L93 Difference]: Finished difference Result 3142 states and 4309 transitions. [2025-03-04 15:02:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:02:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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 228 [2025-03-04 15:02:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:26,359 INFO L225 Difference]: With dead ends: 3142 [2025-03-04 15:02:26,360 INFO L226 Difference]: Without dead ends: 2245 [2025-03-04 15:02:26,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:26,361 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 105 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:26,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1308 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-03-04 15:02:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2227. [2025-03-04 15:02:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2148 states have (on average 1.3486964618249535) internal successors, (2897), 2159 states have internal predecessors, (2897), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2974 transitions. [2025-03-04 15:02:26,417 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2974 transitions. Word has length 228 [2025-03-04 15:02:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 2974 transitions. [2025-03-04 15:02:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2974 transitions. [2025-03-04 15:02:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 15:02:26,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:26,419 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:26,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:02:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:02:26,620 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1412022083, now seen corresponding path program 1 times [2025-03-04 15:02:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446535193] [2025-03-04 15:02:26,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:26,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 15:02:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 15:02:26,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:26,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:26,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446535193] [2025-03-04 15:02:26,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446535193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:26,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995947198] [2025-03-04 15:02:26,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:26,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:26,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:26,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:26,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:02:27,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 15:02:27,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 15:02:27,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:27,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:27,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:02:27,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:27,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995947198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-04 15:02:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129332920] [2025-03-04 15:02:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:27,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:02:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:27,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:02:27,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:02:27,488 INFO L87 Difference]: Start difference. First operand 2227 states and 2974 transitions. Second operand has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:27,616 INFO L93 Difference]: Finished difference Result 2228 states and 2974 transitions. [2025-03-04 15:02:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:02:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 228 [2025-03-04 15:02:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:27,620 INFO L225 Difference]: With dead ends: 2228 [2025-03-04 15:02:27,620 INFO L226 Difference]: Without dead ends: 2227 [2025-03-04 15:02:27,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:02:27,621 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 538 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:27,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1080 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-03-04 15:02:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2226. [2025-03-04 15:02:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2148 states have (on average 1.3472998137802608) internal successors, (2894), 2158 states have internal predecessors, (2894), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2971 transitions. [2025-03-04 15:02:27,780 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2971 transitions. Word has length 228 [2025-03-04 15:02:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:27,781 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2971 transitions. [2025-03-04 15:02:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2971 transitions. [2025-03-04 15:02:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 15:02:27,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:27,783 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:27,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:02:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 15:02:27,983 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 279796415, now seen corresponding path program 1 times [2025-03-04 15:02:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666437775] [2025-03-04 15:02:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:28,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 15:02:28,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 15:02:28,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:28,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 15:02:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666437775] [2025-03-04 15:02:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666437775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:02:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193725323] [2025-03-04 15:02:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:02:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:28,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:02:28,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:02:28,253 INFO L87 Difference]: Start difference. First operand 2226 states and 2971 transitions. Second operand has 5 states, 4 states have (on average 46.5) internal successors, (186), 5 states have internal predecessors, (186), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:28,428 INFO L93 Difference]: Finished difference Result 2393 states and 3190 transitions. [2025-03-04 15:02:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:02:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 46.5) internal successors, (186), 5 states have internal predecessors, (186), 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 228 [2025-03-04 15:02:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:28,432 INFO L225 Difference]: With dead ends: 2393 [2025-03-04 15:02:28,432 INFO L226 Difference]: Without dead ends: 2392 [2025-03-04 15:02:28,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:28,433 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 388 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:28,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1641 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-04 15:02:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2225. [2025-03-04 15:02:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2148 states have (on average 1.344972067039106) internal successors, (2889), 2157 states have internal predecessors, (2889), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2966 transitions. [2025-03-04 15:02:28,491 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2966 transitions. Word has length 228 [2025-03-04 15:02:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:28,492 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 2966 transitions. [2025-03-04 15:02:28,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 46.5) internal successors, (186), 5 states have internal predecessors, (186), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2966 transitions. [2025-03-04 15:02:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-04 15:02:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:28,493 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:02:28,493 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -823011518, now seen corresponding path program 1 times [2025-03-04 15:02:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847127292] [2025-03-04 15:02:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:28,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 15:02:28,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 15:02:28,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:28,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847127292] [2025-03-04 15:02:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847127292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777183116] [2025-03-04 15:02:28,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:28,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:28,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:28,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:02:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 15:02:29,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 15:02:29,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:29,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:29,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:02:29,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:29,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 15:02:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777183116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:02:29,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:02:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 3] total 6 [2025-03-04 15:02:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471758132] [2025-03-04 15:02:29,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:02:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:29,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:02:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:29,572 INFO L87 Difference]: Start difference. First operand 2225 states and 2966 transitions. Second operand has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 7 states have internal predecessors, (530), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 15:02:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:29,777 INFO L93 Difference]: Finished difference Result 4075 states and 5513 transitions. [2025-03-04 15:02:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:02:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 7 states have internal predecessors, (530), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 229 [2025-03-04 15:02:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:29,783 INFO L225 Difference]: With dead ends: 4075 [2025-03-04 15:02:29,783 INFO L226 Difference]: Without dead ends: 4074 [2025-03-04 15:02:29,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:29,784 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1556 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:29,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 1485 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2025-03-04 15:02:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 3908. [2025-03-04 15:02:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3831 states have (on average 1.3719655442443226) internal successors, (5256), 3840 states have internal predecessors, (5256), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5333 transitions. [2025-03-04 15:02:29,961 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5333 transitions. Word has length 229 [2025-03-04 15:02:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:29,961 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5333 transitions. [2025-03-04 15:02:29,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 7 states have internal predecessors, (530), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 15:02:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5333 transitions. [2025-03-04 15:02:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-04 15:02:29,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:29,963 INFO L218 NwaCegarLoop]: trace histogram [22, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:29,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:02:30,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 15:02:30,164 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:30,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1038128119, now seen corresponding path program 1 times [2025-03-04 15:02:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809081500] [2025-03-04 15:02:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:30,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-04 15:02:30,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 15:02:30,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 64 proven. 215 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-04 15:02:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809081500] [2025-03-04 15:02:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809081500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906044274] [2025-03-04 15:02:31,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:31,462 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:31,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:02:31,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-04 15:02:32,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 15:02:32,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:32,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:32,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:02:32,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:32,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:02:32,524 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 19 treesize of output 11 [2025-03-04 15:02:32,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:02:32,603 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-04 15:02:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 57 proven. 34 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-04 15:02:33,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:34,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906044274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:34,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:02:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2025-03-04 15:02:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517638087] [2025-03-04 15:02:34,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:34,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 15:02:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:34,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:02:34,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 15:02:34,996 INFO L87 Difference]: Start difference. First operand 3908 states and 5333 transitions. Second operand has 30 states, 30 states have (on average 10.8) internal successors, (324), 30 states have internal predecessors, (324), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 15:02:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:39,042 INFO L93 Difference]: Finished difference Result 8708 states and 11867 transitions. [2025-03-04 15:02:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 15:02:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 10.8) internal successors, (324), 30 states have internal predecessors, (324), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 235 [2025-03-04 15:02:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:39,048 INFO L225 Difference]: With dead ends: 8708 [2025-03-04 15:02:39,048 INFO L226 Difference]: Without dead ends: 4911 [2025-03-04 15:02:39,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 318 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=348, Invalid=3558, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 15:02:39,053 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 718 mSDsluCounter, 9793 mSDsCounter, 0 mSdLazyCounter, 3875 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 10409 SdHoareTripleChecker+Invalid, 3892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 10409 Invalid, 3892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3875 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 15:02:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2025-03-04 15:02:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 3968. [2025-03-04 15:02:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3891 states have (on average 1.3685427910562837) internal successors, (5325), 3900 states have internal predecessors, (5325), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5402 transitions. [2025-03-04 15:02:39,160 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5402 transitions. Word has length 235 [2025-03-04 15:02:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:39,160 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5402 transitions. [2025-03-04 15:02:39,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.8) internal successors, (324), 30 states have internal predecessors, (324), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 15:02:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5402 transitions. [2025-03-04 15:02:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 15:02:39,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:39,162 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:39,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 15:02:39,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:02:39,362 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1043231380, now seen corresponding path program 1 times [2025-03-04 15:02:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474293761] [2025-03-04 15:02:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:39,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 15:02:39,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 15:02:39,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:39,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-04 15:02:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:39,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474293761] [2025-03-04 15:02:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474293761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:39,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:39,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:02:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141495354] [2025-03-04 15:02:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:39,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:02:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:39,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:02:39,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:02:39,560 INFO L87 Difference]: Start difference. First operand 3968 states and 5402 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:39,711 INFO L93 Difference]: Finished difference Result 7901 states and 10765 transitions. [2025-03-04 15:02:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:02:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 237 [2025-03-04 15:02:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:39,717 INFO L225 Difference]: With dead ends: 7901 [2025-03-04 15:02:39,718 INFO L226 Difference]: Without dead ends: 3968 [2025-03-04 15:02:39,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:02:39,722 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 1 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:39,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 15:02:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2025-03-04 15:02:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3968. [2025-03-04 15:02:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3891 states have (on average 1.3623747108712414) internal successors, (5301), 3900 states have internal predecessors, (5301), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5378 transitions. [2025-03-04 15:02:39,823 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5378 transitions. Word has length 237 [2025-03-04 15:02:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5378 transitions. [2025-03-04 15:02:39,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5378 transitions. [2025-03-04 15:02:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 15:02:39,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:39,825 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:39,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 15:02:39,825 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1700644017, now seen corresponding path program 1 times [2025-03-04 15:02:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472463236] [2025-03-04 15:02:39,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 15:02:39,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 15:02:39,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:39,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-04 15:02:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472463236] [2025-03-04 15:02:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472463236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:40,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:02:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88061175] [2025-03-04 15:02:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:40,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:02:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:40,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:02:40,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:02:40,045 INFO L87 Difference]: Start difference. First operand 3968 states and 5378 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:40,253 INFO L93 Difference]: Finished difference Result 7867 states and 10686 transitions. [2025-03-04 15:02:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:02:40,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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 237 [2025-03-04 15:02:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:40,259 INFO L225 Difference]: With dead ends: 7867 [2025-03-04 15:02:40,260 INFO L226 Difference]: Without dead ends: 3932 [2025-03-04 15:02:40,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:02:40,263 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 9 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:40,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1370 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2025-03-04 15:02:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3932. [2025-03-04 15:02:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3855 states have (on average 1.3636835278858626) internal successors, (5257), 3864 states have internal predecessors, (5257), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5334 transitions. [2025-03-04 15:02:40,412 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5334 transitions. Word has length 237 [2025-03-04 15:02:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:40,412 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5334 transitions. [2025-03-04 15:02:40,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5334 transitions. [2025-03-04 15:02:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-04 15:02:40,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:40,414 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:40,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 15:02:40,415 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1117056741, now seen corresponding path program 1 times [2025-03-04 15:02:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076567903] [2025-03-04 15:02:40,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 15:02:40,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 15:02:40,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:40,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 65 proven. 252 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 15:02:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076567903] [2025-03-04 15:02:41,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076567903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680343060] [2025-03-04 15:02:41,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:41,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:41,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:41,719 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:41,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:02:42,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 15:02:42,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 15:02:42,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:42,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:42,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:02:42,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-04 15:02:42,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:02:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680343060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:02:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2025-03-04 15:02:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637845278] [2025-03-04 15:02:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:02:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:42,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:02:42,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:02:42,457 INFO L87 Difference]: Start difference. First operand 3932 states and 5334 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:42,676 INFO L93 Difference]: Finished difference Result 7552 states and 10310 transitions. [2025-03-04 15:02:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:02:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 238 [2025-03-04 15:02:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:42,683 INFO L225 Difference]: With dead ends: 7552 [2025-03-04 15:02:42,683 INFO L226 Difference]: Without dead ends: 3932 [2025-03-04 15:02:42,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:02:42,687 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 13 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1296 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-04 15:02:42,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1296 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:02:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2025-03-04 15:02:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3932. [2025-03-04 15:02:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3855 states have (on average 1.3623865110246434) internal successors, (5252), 3864 states have internal predecessors, (5252), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5329 transitions. [2025-03-04 15:02:42,804 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5329 transitions. Word has length 238 [2025-03-04 15:02:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:42,804 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5329 transitions. [2025-03-04 15:02:42,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5329 transitions. [2025-03-04 15:02:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-04 15:02:42,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:42,806 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:42,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 15:02:43,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 15:02:43,006 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:43,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1234549240, now seen corresponding path program 1 times [2025-03-04 15:02:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:43,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505880007] [2025-03-04 15:02:43,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:43,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-04 15:02:43,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-04 15:02:43,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-04 15:02:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505880007] [2025-03-04 15:02:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505880007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:43,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:02:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007629923] [2025-03-04 15:02:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:43,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:02:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:02:43,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:02:43,358 INFO L87 Difference]: Start difference. First operand 3932 states and 5329 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:43,632 INFO L93 Difference]: Finished difference Result 7567 states and 10325 transitions. [2025-03-04 15:02:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:02:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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 239 [2025-03-04 15:02:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:43,637 INFO L225 Difference]: With dead ends: 7567 [2025-03-04 15:02:43,637 INFO L226 Difference]: Without dead ends: 3947 [2025-03-04 15:02:43,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:02:43,641 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 4 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:43,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2086 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:02:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-04 15:02:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3947. [2025-03-04 15:02:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3870 states have (on average 1.3609819121447029) internal successors, (5267), 3879 states have internal predecessors, (5267), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5344 transitions. [2025-03-04 15:02:43,726 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5344 transitions. Word has length 239 [2025-03-04 15:02:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:43,727 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5344 transitions. [2025-03-04 15:02:43,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5344 transitions. [2025-03-04 15:02:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 15:02:43,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:43,728 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 15:02:43,728 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 237455113, now seen corresponding path program 1 times [2025-03-04 15:02:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729409337] [2025-03-04 15:02:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:43,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 15:02:43,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 15:02:43,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:43,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-04 15:02:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729409337] [2025-03-04 15:02:44,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729409337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:02:44,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:02:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:02:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594097206] [2025-03-04 15:02:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:02:44,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:02:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:44,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:02:44,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:44,058 INFO L87 Difference]: Start difference. First operand 3947 states and 5344 transitions. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:44,394 INFO L93 Difference]: Finished difference Result 7875 states and 10681 transitions. [2025-03-04 15:02:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:02:44,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 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 240 [2025-03-04 15:02:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:44,399 INFO L225 Difference]: With dead ends: 7875 [2025-03-04 15:02:44,400 INFO L226 Difference]: Without dead ends: 3977 [2025-03-04 15:02:44,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:02:44,403 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 8 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:44,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2484 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:02:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2025-03-04 15:02:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3971. [2025-03-04 15:02:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3894 states have (on average 1.3602978941961992) internal successors, (5297), 3903 states have internal predecessors, (5297), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5374 transitions. [2025-03-04 15:02:44,489 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5374 transitions. Word has length 240 [2025-03-04 15:02:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:44,489 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5374 transitions. [2025-03-04 15:02:44,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 15:02:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5374 transitions. [2025-03-04 15:02:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 15:02:44,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:44,491 INFO L218 NwaCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 15:02:44,491 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 996294232, now seen corresponding path program 1 times [2025-03-04 15:02:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242306488] [2025-03-04 15:02:44,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:44,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 15:02:44,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 15:02:44,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 67 proven. 252 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 15:02:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242306488] [2025-03-04 15:02:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242306488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904616423] [2025-03-04 15:02:45,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:02:45,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:45,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:45,564 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:45,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 15:02:46,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 15:02:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 15:02:46,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:02:46,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:46,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 15:02:46,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:02:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 249 proven. 78 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 15:02:47,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:02:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 67 proven. 252 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 15:02:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904616423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:02:48,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:02:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 17] total 50 [2025-03-04 15:02:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088989238] [2025-03-04 15:02:48,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:02:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 15:02:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:02:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 15:02:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 15:02:48,011 INFO L87 Difference]: Start difference. First operand 3971 states and 5374 transitions. Second operand has 50 states, 50 states have (on average 4.88) internal successors, (244), 50 states have internal predecessors, (244), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:02:57,472 INFO L93 Difference]: Finished difference Result 7967 states and 10848 transitions. [2025-03-04 15:02:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 15:02:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.88) internal successors, (244), 50 states have internal predecessors, (244), 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 240 [2025-03-04 15:02:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:02:57,478 INFO L225 Difference]: With dead ends: 7967 [2025-03-04 15:02:57,478 INFO L226 Difference]: Without dead ends: 4094 [2025-03-04 15:02:57,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1874, Invalid=6316, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 15:02:57,483 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 85 mSDsluCounter, 8390 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 8858 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 15:02:57,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 8858 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 15:02:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2025-03-04 15:02:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4029. [2025-03-04 15:02:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4029 states, 3952 states have (on average 1.355263157894737) internal successors, (5356), 3961 states have internal predecessors, (5356), 38 states have call successors, (38), 35 states have call predecessors, (38), 32 states have return successors, (39), 32 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-04 15:02:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 5433 transitions. [2025-03-04 15:02:57,587 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 5433 transitions. Word has length 240 [2025-03-04 15:02:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:02:57,588 INFO L471 AbstractCegarLoop]: Abstraction has 4029 states and 5433 transitions. [2025-03-04 15:02:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.88) internal successors, (244), 50 states have internal predecessors, (244), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 15:02:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 5433 transitions. [2025-03-04 15:02:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 15:02:57,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:02:57,589 INFO L218 NwaCegarLoop]: trace histogram [39, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:02:57,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 15:02:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:02:57,790 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:02:57,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:02:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1180451215, now seen corresponding path program 2 times [2025-03-04 15:02:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:02:57,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859182958] [2025-03-04 15:02:57,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:02:57,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 255 statements into 2 equivalence classes. [2025-03-04 15:02:58,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 15:02:58,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:02:58,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:02:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 67 proven. 734 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 15:02:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:02:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859182958] [2025-03-04 15:02:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859182958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:02:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992331814] [2025-03-04 15:02:59,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:02:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:02:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:02:59,698 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:02:59,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 15:03:00,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 255 statements into 2 equivalence classes. [2025-03-04 15:03:00,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 15:03:00,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:03:00,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:00,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 15:03:00,741 INFO L279 TraceCheckSpWp]: Computing forward predicates...