./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:10:37,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:10:37,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 21:10:37,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:10:37,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:10:37,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:10:37,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:10:37,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:10:37,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:10:37,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:10:37,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:10:37,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:10:37,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:10:37,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:10:37,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:10:37,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:10:37,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:10:37,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:10:37,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:10:37,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:10:37,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:10:37,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:10:37,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:10:37,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:10:37,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:10:37,644 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-08 21:10:37,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:10:37,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:10:37,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:10:37,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:10:37,872 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:10:37,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-08 21:10:38,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884c2a969/86ed33a332494727b6bbace6e3d3f0f6/FLAG717ff4f90 [2025-03-08 21:10:39,362 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:10:39,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-08 21:10:39,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884c2a969/86ed33a332494727b6bbace6e3d3f0f6/FLAG717ff4f90 [2025-03-08 21:10:39,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884c2a969/86ed33a332494727b6bbace6e3d3f0f6 [2025-03-08 21:10:39,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:10:39,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:10:39,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:10:39,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:10:39,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:10:39,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:10:39" (1/1) ... [2025-03-08 21:10:39,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227ec695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:39, skipping insertion in model container [2025-03-08 21:10:39,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:10:39" (1/1) ... [2025-03-08 21:10:39,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:10:40,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-03-08 21:10:40,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-03-08 21:10:40,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-03-08 21:10:40,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-03-08 21:10:40,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-03-08 21:10:40,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-03-08 21:10:40,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-03-08 21:10:40,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-03-08 21:10:40,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-03-08 21:10:40,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-03-08 21:10:40,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-03-08 21:10:40,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-03-08 21:10:40,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-03-08 21:10:40,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-03-08 21:10:40,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:10:40,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:10:40,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-03-08 21:10:40,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-03-08 21:10:40,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-03-08 21:10:40,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-03-08 21:10:40,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-03-08 21:10:40,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-03-08 21:10:40,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-03-08 21:10:40,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-03-08 21:10:40,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-03-08 21:10:40,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-03-08 21:10:40,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-03-08 21:10:40,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-03-08 21:10:40,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-03-08 21:10:40,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-03-08 21:10:40,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:10:40,693 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-08 21:10:40,699 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:10:40,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40 WrapperNode [2025-03-08 21:10:40,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:10:40,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:10:40,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:10:40,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:10:40,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,812 INFO L138 Inliner]: procedures = 648, calls = 850, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1825 [2025-03-08 21:10:40,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:10:40,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:10:40,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:10:40,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:10:40,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,841 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 21:10:40,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:10:40,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:10:40,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:10:40,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:10:40,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (1/1) ... [2025-03-08 21:10:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:10:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:10:40,965 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-08 21:10:40,968 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-08 21:10:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 21:10:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-08 21:10:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-08 21:10:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:10:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 21:10:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-08 21:10:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-08 21:10:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-08 21:10:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-08 21:10:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-08 21:10:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-08 21:10:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 21:10:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-08 21:10:40,989 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-08 21:10:40,989 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-08 21:10:40,989 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:10:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-08 21:10:40,989 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-08 21:10:41,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:10:41,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:10:41,402 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-08 21:10:41,634 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-08 21:10:41,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-08 21:10:41,837 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-08 21:10:41,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-08 21:10:41,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-08 21:10:41,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-08 21:10:46,598 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-08 21:10:46,599 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-08 21:10:46,599 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-08 21:10:46,725 INFO L? ?]: Removed 570 outVars from TransFormulas that were not future-live. [2025-03-08 21:10:46,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:10:46,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:10:46,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:10:46,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:10:46 BoogieIcfgContainer [2025-03-08 21:10:46,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:10:46,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:10:46,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:10:46,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:10:46,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:10:39" (1/3) ... [2025-03-08 21:10:46,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aba00a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:10:46, skipping insertion in model container [2025-03-08 21:10:46,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:10:40" (2/3) ... [2025-03-08 21:10:46,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aba00a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:10:46, skipping insertion in model container [2025-03-08 21:10:46,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:10:46" (3/3) ... [2025-03-08 21:10:46,764 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-08 21:10:46,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:10:46,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 14 procedures, 421 locations, 1 initial locations, 23 loop locations, and 16 error locations. [2025-03-08 21:10:46,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:10:46,845 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;@75f7a28e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:10:46,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-08 21:10:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 353 states have (on average 1.538243626062323) internal successors, (543), 370 states have internal predecessors, (543), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 21:10:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 21:10:46,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:46,855 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] [2025-03-08 21:10:46,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2090184970, now seen corresponding path program 1 times [2025-03-08 21:10:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657682390] [2025-03-08 21:10:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:10:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:10:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:48,133 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-08 21:10:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657682390] [2025-03-08 21:10:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657682390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:10:48,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:10:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:10:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276834856] [2025-03-08 21:10:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:10:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:10:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:10:48,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:10:48,156 INFO L87 Difference]: Start difference. First operand has 421 states, 353 states have (on average 1.538243626062323) internal successors, (543), 370 states have internal predecessors, (543), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:48,281 INFO L93 Difference]: Finished difference Result 791 states and 1189 transitions. [2025-03-08 21:10:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:10:48,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 21:10:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:48,293 INFO L225 Difference]: With dead ends: 791 [2025-03-08 21:10:48,293 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 21:10:48,300 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-08 21:10:48,304 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:48,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:10:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 21:10:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-08 21:10:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 302 states have (on average 1.4337748344370862) internal successors, (433), 319 states have internal predecessors, (433), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 499 transitions. [2025-03-08 21:10:48,354 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 499 transitions. Word has length 25 [2025-03-08 21:10:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 499 transitions. [2025-03-08 21:10:48,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 499 transitions. [2025-03-08 21:10:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 21:10:48,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:48,357 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] [2025-03-08 21:10:48,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:10:48,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 566671075, now seen corresponding path program 1 times [2025-03-08 21:10:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115706263] [2025-03-08 21:10:48,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:10:48,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:10:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:10:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115706263] [2025-03-08 21:10:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115706263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:10:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578944611] [2025-03-08 21:10:49,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:10:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:10:49,116 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-08 21:10:49,117 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-08 21:10:49,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:10:50,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:10:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:50,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:10:50,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:10:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:10:50,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:10:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:10:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578944611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:10:50,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:10:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 21:10:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091548093] [2025-03-08 21:10:50,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:10:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:10:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:10:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:10:50,219 INFO L87 Difference]: Start difference. First operand 363 states and 499 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:10:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:50,301 INFO L93 Difference]: Finished difference Result 725 states and 999 transitions. [2025-03-08 21:10:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:10:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 21:10:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:50,304 INFO L225 Difference]: With dead ends: 725 [2025-03-08 21:10:50,304 INFO L226 Difference]: Without dead ends: 366 [2025-03-08 21:10:50,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:10:50,305 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:50,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 984 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:10:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-08 21:10:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-08 21:10:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 305 states have (on average 1.4295081967213115) internal successors, (436), 322 states have internal predecessors, (436), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 502 transitions. [2025-03-08 21:10:50,332 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 502 transitions. Word has length 26 [2025-03-08 21:10:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 502 transitions. [2025-03-08 21:10:50,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:10:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 502 transitions. [2025-03-08 21:10:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 21:10:50,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:50,333 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 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-08 21:10:50,348 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-08 21:10:50,533 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-08 21:10:50,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1913972523, now seen corresponding path program 2 times [2025-03-08 21:10:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248188286] [2025-03-08 21:10:50,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:10:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:51,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 21:10:51,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-03-08 21:10:51,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:10:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 21:10:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248188286] [2025-03-08 21:10:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248188286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:10:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:10:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:10:51,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170851596] [2025-03-08 21:10:51,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:10:51,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:10:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:51,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:10:51,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:10:51,346 INFO L87 Difference]: Start difference. First operand 366 states and 502 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:51,462 INFO L93 Difference]: Finished difference Result 382 states and 517 transitions. [2025-03-08 21:10:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:10:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-08 21:10:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:51,464 INFO L225 Difference]: With dead ends: 382 [2025-03-08 21:10:51,464 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 21:10:51,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:10:51,465 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 17 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:51,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2442 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:10:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 21:10:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2025-03-08 21:10:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 309 states have (on average 1.4239482200647249) internal successors, (440), 325 states have internal predecessors, (440), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 507 transitions. [2025-03-08 21:10:51,476 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 507 transitions. Word has length 29 [2025-03-08 21:10:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:51,477 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 507 transitions. [2025-03-08 21:10:51,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 507 transitions. [2025-03-08 21:10:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 21:10:51,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:51,478 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 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-08 21:10:51,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:10:51,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:51,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1913971562, now seen corresponding path program 1 times [2025-03-08 21:10:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195570146] [2025-03-08 21:10:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:51,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:10:51,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:10:51,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:52,412 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-08 21:10:52,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195570146] [2025-03-08 21:10:52,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195570146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:10:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234078825] [2025-03-08 21:10:52,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:10:52,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:10:52,416 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-08 21:10:52,420 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-08 21:10:53,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:10:53,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:10:53,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:53,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:53,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1965 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:10:53,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:10:53,351 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-08 21:10:53,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:10:53,503 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-08 21:10:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234078825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:10:53,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:10:53,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 21:10:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369751837] [2025-03-08 21:10:53,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:10:53,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:10:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:53,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:10:53,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:10:53,504 INFO L87 Difference]: Start difference. First operand 371 states and 507 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:10:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:53,629 INFO L93 Difference]: Finished difference Result 741 states and 1018 transitions. [2025-03-08 21:10:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 21:10:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-08 21:10:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:53,633 INFO L225 Difference]: With dead ends: 741 [2025-03-08 21:10:53,633 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 21:10:53,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:10:53,634 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:53,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1966 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:10:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 21:10:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-08 21:10:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 315 states have (on average 1.415873015873016) internal successors, (446), 331 states have internal predecessors, (446), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 513 transitions. [2025-03-08 21:10:53,654 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 513 transitions. Word has length 29 [2025-03-08 21:10:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:53,654 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 513 transitions. [2025-03-08 21:10:53,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:10:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 513 transitions. [2025-03-08 21:10:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 21:10:53,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:53,655 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 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-08 21:10:53,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:10:53,856 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,SelfDestructingSolverStorable3 [2025-03-08 21:10:53,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:53,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash 721994198, now seen corresponding path program 2 times [2025-03-08 21:10:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335356542] [2025-03-08 21:10:53,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:10:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:54,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 21:10:54,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 35 statements. [2025-03-08 21:10:54,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:10:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335356542] [2025-03-08 21:10:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335356542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:10:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:10:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:10:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116410284] [2025-03-08 21:10:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:10:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:10:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:54,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:10:54,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:10:54,731 INFO L87 Difference]: Start difference. First operand 377 states and 513 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:54,918 INFO L93 Difference]: Finished difference Result 739 states and 1009 transitions. [2025-03-08 21:10:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:10:54,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-08 21:10:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:54,920 INFO L225 Difference]: With dead ends: 739 [2025-03-08 21:10:54,920 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 21:10:54,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:10:54,921 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 136 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:54,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1926 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:10:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 21:10:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378. [2025-03-08 21:10:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 316 states have (on average 1.4145569620253164) internal successors, (447), 332 states have internal predecessors, (447), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2025-03-08 21:10:54,930 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 35 [2025-03-08 21:10:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2025-03-08 21:10:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2025-03-08 21:10:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 21:10:54,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:54,932 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 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-08 21:10:54,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:10:54,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:54,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1554581932, now seen corresponding path program 1 times [2025-03-08 21:10:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:54,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424889257] [2025-03-08 21:10:54,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:55,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 21:10:55,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 21:10:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424889257] [2025-03-08 21:10:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424889257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:10:55,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:10:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:10:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374556448] [2025-03-08 21:10:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:10:55,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:10:55,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:55,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:10:55,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:10:55,576 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:55,634 INFO L93 Difference]: Finished difference Result 741 states and 1012 transitions. [2025-03-08 21:10:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:10:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-08 21:10:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:55,637 INFO L225 Difference]: With dead ends: 741 [2025-03-08 21:10:55,637 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 21:10:55,638 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-08 21:10:55,639 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:55,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:10:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 21:10:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-08 21:10:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 317 states have (on average 1.413249211356467) internal successors, (448), 333 states have internal predecessors, (448), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 515 transitions. [2025-03-08 21:10:55,651 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 515 transitions. Word has length 37 [2025-03-08 21:10:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:55,652 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 515 transitions. [2025-03-08 21:10:55,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 515 transitions. [2025-03-08 21:10:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 21:10:55,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:55,656 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 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-08 21:10:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:10:55,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1888244409, now seen corresponding path program 1 times [2025-03-08 21:10:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222673258] [2025-03-08 21:10:55,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:56,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:10:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:10:56,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:56,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222673258] [2025-03-08 21:10:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222673258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:10:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445951225] [2025-03-08 21:10:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:10:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:10:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:10:56,293 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-08 21:10:56,295 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-08 21:10:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:10:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:10:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:10:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:57,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:10:57,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:10:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:57,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:10:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445951225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:10:57,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:10:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 21:10:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802937877] [2025-03-08 21:10:57,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:10:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:10:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:10:57,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:10:57,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:10:57,329 INFO L87 Difference]: Start difference. First operand 379 states and 515 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:10:57,423 INFO L93 Difference]: Finished difference Result 745 states and 1018 transitions. [2025-03-08 21:10:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:10:57,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-03-08 21:10:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:10:57,425 INFO L225 Difference]: With dead ends: 745 [2025-03-08 21:10:57,425 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 21:10:57,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:10:57,427 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:10:57,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:10:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 21:10:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-08 21:10:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 320 states have (on average 1.409375) internal successors, (451), 336 states have internal predecessors, (451), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 21:10:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 518 transitions. [2025-03-08 21:10:57,443 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 518 transitions. Word has length 38 [2025-03-08 21:10:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:10:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 518 transitions. [2025-03-08 21:10:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 21:10:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 518 transitions. [2025-03-08 21:10:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 21:10:57,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:10:57,445 INFO L218 NwaCegarLoop]: trace histogram [10, 4, 1, 1, 1, 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-08 21:10:57,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:10:57,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:10:57,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 21:10:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:10:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -201496684, now seen corresponding path program 2 times [2025-03-08 21:10:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:10:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399297664] [2025-03-08 21:10:57,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:10:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:10:58,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 21:10:58,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 21:10:58,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:10:58,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:10:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 21:10:58,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:10:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399297664] [2025-03-08 21:10:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399297664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:10:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588147193] [2025-03-08 21:10:58,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:10:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:10:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:10:58,676 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-08 21:10:58,677 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-08 21:10:59,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes.