./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:53:50,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:53:50,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:53:50,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:53:50,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:53:50,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:53:50,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:53:50,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:53:50,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:53:50,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:53:50,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:53:50,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:53:50,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:53:50,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:53:50,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:53:50,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:53:50,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:53:50,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:53:50,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:53:50,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:53:50,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:53:50,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:53:50,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:53:50,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:53:50,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:53:50,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:53:50,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:53:50,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:53:50,445 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-03-17 05:53:50,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:53:50,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:53:50,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:53:50,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:53:50,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:53:50,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:53:51,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1704486e6/320f2716167b4ae68b81ab720debfbc3/FLAG95f6a14e3 [2025-03-17 05:53:52,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:53:52,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:53:52,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1704486e6/320f2716167b4ae68b81ab720debfbc3/FLAG95f6a14e3 [2025-03-17 05:53:52,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1704486e6/320f2716167b4ae68b81ab720debfbc3 [2025-03-17 05:53:52,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:53:52,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:53:52,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:53:52,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:53:52,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:53:52,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5aff80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52, skipping insertion in model container [2025-03-17 05:53:52,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:53:52,347 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-03-17 05:53:52,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:53:52,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:53:52,432 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-03-17 05:53:52,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:53:52,491 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:53:52,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52 WrapperNode [2025-03-17 05:53:52,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:53:52,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:53:52,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:53:52,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:53:52,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,549 INFO L138 Inliner]: procedures = 30, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-03-17 05:53:52,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:53:52,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:53:52,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:53:52,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:53:52,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,571 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:53:52,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:53:52,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:53:52,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:53:52,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:53:52,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (1/1) ... [2025-03-17 05:53:52,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:53:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:53:52,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:53:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:53:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:53:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:53:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:53:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:53:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:53:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:53:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:53:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:53:52,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:53:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:53:52,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:53:52,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:53:52,755 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:53:52,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:53:53,202 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-03-17 05:53:53,237 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:53:53,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:53:53,251 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:53:53,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:53:53,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:53:53 BoogieIcfgContainer [2025-03-17 05:53:53,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:53:53,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:53:53,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:53:53,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:53:53,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:53:52" (1/3) ... [2025-03-17 05:53:53,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1523cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:53:53, skipping insertion in model container [2025-03-17 05:53:53,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:53:52" (2/3) ... [2025-03-17 05:53:53,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1523cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:53:53, skipping insertion in model container [2025-03-17 05:53:53,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:53:53" (3/3) ... [2025-03-17 05:53:53,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:53:53,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:53:53,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:53:53,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:53:53,335 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;@6dcca3a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:53:53,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:53:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:53:53,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:53,351 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:53,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1221886058, now seen corresponding path program 1 times [2025-03-17 05:53:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:53,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060218612] [2025-03-17 05:53:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:53,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:53:53,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:53:53,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:53:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060218612] [2025-03-17 05:53:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060218612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:53:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888728697] [2025-03-17 05:53:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:53:53,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:53:53,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:53:53,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:53:53,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:53:53,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:53,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:53:53,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:53:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:53:53,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:53:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888728697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:53:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:53:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578238537] [2025-03-17 05:53:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:53:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:53:53,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:53:53,923 INFO L87 Difference]: Start difference. First operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:53,944 INFO L93 Difference]: Finished difference Result 209 states and 331 transitions. [2025-03-17 05:53:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:53:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-17 05:53:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:53,950 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:53:53,950 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:53:53,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:53:53,956 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:53,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:53:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:53:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:53:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2025-03-17 05:53:53,993 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 127 [2025-03-17 05:53:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:53,993 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2025-03-17 05:53:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2025-03-17 05:53:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:53:54,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:54,000 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:54,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:53:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:53:54,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1103498399, now seen corresponding path program 1 times [2025-03-17 05:53:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118636268] [2025-03-17 05:53:54,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:54,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:53:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:53:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118636268] [2025-03-17 05:53:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118636268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:53:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343076583] [2025-03-17 05:53:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:53:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:54,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:53:54,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:53:54,495 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:54,532 INFO L93 Difference]: Finished difference Result 209 states and 312 transitions. [2025-03-17 05:53:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:53:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-17 05:53:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:54,536 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:53:54,536 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:53:54,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:53:54,537 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:54,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:53:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:53:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 05:53:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-03-17 05:53:54,551 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 127 [2025-03-17 05:53:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-03-17 05:53:54,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-03-17 05:53:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:53:54,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:54,555 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:54,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:53:54,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:54,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash 832161888, now seen corresponding path program 1 times [2025-03-17 05:53:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015603324] [2025-03-17 05:53:54,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:54,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:53:54,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:53:54,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:54,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:53:54,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015603324] [2025-03-17 05:53:54,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015603324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:53:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320659458] [2025-03-17 05:53:54,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:53:54,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:53:54,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:53:54,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:53:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:53:54,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:53:54,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:54,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:54,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:53:54,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:53:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:55,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:53:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320659458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:53:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:53:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39161228] [2025-03-17 05:53:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:55,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:53:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:55,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:53:55,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:53:55,027 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:55,059 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2025-03-17 05:53:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:53:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-17 05:53:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:55,060 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:53:55,060 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:53:55,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:53:55,061 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:55,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:53:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:53:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 05:53:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-03-17 05:53:55,067 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 127 [2025-03-17 05:53:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:55,067 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-03-17 05:53:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-03-17 05:53:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:53:55,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:55,069 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:55,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:53:55,269 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,SelfDestructingSolverStorable2 [2025-03-17 05:53:55,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 953534174, now seen corresponding path program 1 times [2025-03-17 05:53:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432504528] [2025-03-17 05:53:55,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:55,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:53:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:53:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432504528] [2025-03-17 05:53:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432504528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:53:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914976295] [2025-03-17 05:53:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:53:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:55,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:53:55,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:53:55,635 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:55,837 INFO L93 Difference]: Finished difference Result 249 states and 366 transitions. [2025-03-17 05:53:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:53:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-17 05:53:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:55,839 INFO L225 Difference]: With dead ends: 249 [2025-03-17 05:53:55,839 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:53:55,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:53:55,840 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 93 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:55,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 398 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:53:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:53:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2025-03-17 05:53:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2025-03-17 05:53:55,852 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 129 [2025-03-17 05:53:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:55,853 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2025-03-17 05:53:55,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2025-03-17 05:53:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:53:55,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:55,854 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:55,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:53:55,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1988123425, now seen corresponding path program 1 times [2025-03-17 05:53:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879372160] [2025-03-17 05:53:55,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:55,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:53:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:53:55,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879372160] [2025-03-17 05:53:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879372160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:53:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745094479] [2025-03-17 05:53:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:53:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:56,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:53:56,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:53:56,094 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:56,215 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2025-03-17 05:53:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:53:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-17 05:53:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:56,219 INFO L225 Difference]: With dead ends: 228 [2025-03-17 05:53:56,219 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 05:53:56,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:53:56,220 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:56,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 370 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:53:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 05:53:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-17 05:53:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2025-03-17 05:53:56,231 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 129 [2025-03-17 05:53:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:56,232 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2025-03-17 05:53:56,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2025-03-17 05:53:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:53:56,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:56,234 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:53:56,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:56,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1859040706, now seen corresponding path program 1 times [2025-03-17 05:53:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017301997] [2025-03-17 05:53:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:53:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:53:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017301997] [2025-03-17 05:53:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017301997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:53:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794640694] [2025-03-17 05:53:57,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:57,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:53:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:57,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:53:57,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:53:57,468 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:57,729 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2025-03-17 05:53:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:53:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-17 05:53:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:57,731 INFO L225 Difference]: With dead ends: 268 [2025-03-17 05:53:57,731 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 05:53:57,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:53:57,732 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 102 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:57,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 406 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:53:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 05:53:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2025-03-17 05:53:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:53:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-03-17 05:53:57,746 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 129 [2025-03-17 05:53:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-03-17 05:53:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-03-17 05:53:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:53:57,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:57,747 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:53:57,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 54923930, now seen corresponding path program 1 times [2025-03-17 05:53:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988643048] [2025-03-17 05:53:57,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:53:57,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:53:57,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:57,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988643048] [2025-03-17 05:53:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988643048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:58,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:53:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824599268] [2025-03-17 05:53:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:53:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:58,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:53:58,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:53:58,006 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:58,210 INFO L93 Difference]: Finished difference Result 304 states and 440 transitions. [2025-03-17 05:53:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:53:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:53:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:58,212 INFO L225 Difference]: With dead ends: 304 [2025-03-17 05:53:58,212 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 05:53:58,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:53:58,213 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 65 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:58,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 623 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:53:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 05:53:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2025-03-17 05:53:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 160 states have (on average 1.4) internal successors, (224), 161 states have internal predecessors, (224), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:53:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2025-03-17 05:53:58,227 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 130 [2025-03-17 05:53:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:58,228 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2025-03-17 05:53:58,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:53:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2025-03-17 05:53:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:53:58,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:58,229 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:58,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:53:58,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:58,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash -141589575, now seen corresponding path program 1 times [2025-03-17 05:53:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480279573] [2025-03-17 05:53:58,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:58,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:53:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:53:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:53:58,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:53:58,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:53:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:53:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:53:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480279573] [2025-03-17 05:53:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480279573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:53:59,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:53:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:53:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182019323] [2025-03-17 05:53:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:53:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:53:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:53:59,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:53:59,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:53:59,285 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:53:59,958 INFO L93 Difference]: Finished difference Result 614 states and 885 transitions. [2025-03-17 05:53:59,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:53:59,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:53:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:53:59,961 INFO L225 Difference]: With dead ends: 614 [2025-03-17 05:53:59,961 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 05:53:59,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:53:59,962 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 282 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:53:59,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 772 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:53:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 05:53:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 426. [2025-03-17 05:53:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 378 states have (on average 1.3994708994708995) internal successors, (529), 381 states have internal predecessors, (529), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:53:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 613 transitions. [2025-03-17 05:53:59,989 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 613 transitions. Word has length 130 [2025-03-17 05:53:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:53:59,989 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 613 transitions. [2025-03-17 05:53:59,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:53:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 613 transitions. [2025-03-17 05:53:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:53:59,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:53:59,993 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:53:59,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:53:59,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:53:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:53:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash -353900295, now seen corresponding path program 1 times [2025-03-17 05:53:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:53:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926035648] [2025-03-17 05:53:59,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:53:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:00,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:00,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:00,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:00,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926035648] [2025-03-17 05:54:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926035648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:54:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602637069] [2025-03-17 05:54:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:54:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:00,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:54:00,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:00,929 INFO L87 Difference]: Start difference. First operand 426 states and 613 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:01,814 INFO L93 Difference]: Finished difference Result 687 states and 977 transitions. [2025-03-17 05:54:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:54:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:54:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:01,816 INFO L225 Difference]: With dead ends: 687 [2025-03-17 05:54:01,817 INFO L226 Difference]: Without dead ends: 444 [2025-03-17 05:54:01,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:01,819 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 205 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:01,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 858 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:54:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-17 05:54:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 438. [2025-03-17 05:54:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 386 states have (on average 1.38860103626943) internal successors, (536), 390 states have internal predecessors, (536), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:54:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 624 transitions. [2025-03-17 05:54:01,847 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 624 transitions. Word has length 130 [2025-03-17 05:54:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:01,848 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 624 transitions. [2025-03-17 05:54:01,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 624 transitions. [2025-03-17 05:54:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:54:01,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:01,849 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:01,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:54:01,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:01,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash -550413800, now seen corresponding path program 1 times [2025-03-17 05:54:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770082114] [2025-03-17 05:54:01,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:01,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:01,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:01,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770082114] [2025-03-17 05:54:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770082114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515699404] [2025-03-17 05:54:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:02,025 INFO L87 Difference]: Start difference. First operand 438 states and 624 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:02,287 INFO L93 Difference]: Finished difference Result 1001 states and 1436 transitions. [2025-03-17 05:54:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:54:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:54:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:02,291 INFO L225 Difference]: With dead ends: 1001 [2025-03-17 05:54:02,291 INFO L226 Difference]: Without dead ends: 572 [2025-03-17 05:54:02,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:02,292 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 132 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:02,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 950 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-17 05:54:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 542. [2025-03-17 05:54:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 465 states have (on average 1.3741935483870968) internal successors, (639), 469 states have internal predecessors, (639), 67 states have call successors, (67), 9 states have call predecessors, (67), 9 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:54:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 773 transitions. [2025-03-17 05:54:02,322 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 773 transitions. Word has length 130 [2025-03-17 05:54:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 773 transitions. [2025-03-17 05:54:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 773 transitions. [2025-03-17 05:54:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:54:02,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:02,327 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:02,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:54:02,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:02,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2144115642, now seen corresponding path program 1 times [2025-03-17 05:54:02,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270421147] [2025-03-17 05:54:02,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:02,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:02,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270421147] [2025-03-17 05:54:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270421147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:54:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945930270] [2025-03-17 05:54:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:54:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:02,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:54:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:02,901 INFO L87 Difference]: Start difference. First operand 542 states and 773 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:03,075 INFO L93 Difference]: Finished difference Result 1520 states and 2168 transitions. [2025-03-17 05:54:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:54:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:54:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:03,081 INFO L225 Difference]: With dead ends: 1520 [2025-03-17 05:54:03,081 INFO L226 Difference]: Without dead ends: 993 [2025-03-17 05:54:03,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:03,084 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 86 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:03,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 261 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:54:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-03-17 05:54:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 987. [2025-03-17 05:54:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 840 states have (on average 1.361904761904762) internal successors, (1144), 847 states have internal predecessors, (1144), 129 states have call successors, (129), 17 states have call predecessors, (129), 17 states have return successors, (129), 122 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-17 05:54:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1402 transitions. [2025-03-17 05:54:03,142 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1402 transitions. Word has length 130 [2025-03-17 05:54:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:03,144 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1402 transitions. [2025-03-17 05:54:03,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1402 transitions. [2025-03-17 05:54:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:54:03,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:03,146 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:54:03,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 69761338, now seen corresponding path program 1 times [2025-03-17 05:54:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:03,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998389910] [2025-03-17 05:54:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:03,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998389910] [2025-03-17 05:54:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998389910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:03,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:54:03,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431049256] [2025-03-17 05:54:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:03,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:54:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:03,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:54:03,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:03,671 INFO L87 Difference]: Start difference. First operand 987 states and 1402 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:03,846 INFO L93 Difference]: Finished difference Result 1922 states and 2731 transitions. [2025-03-17 05:54:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:54:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:54:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:03,850 INFO L225 Difference]: With dead ends: 1922 [2025-03-17 05:54:03,851 INFO L226 Difference]: Without dead ends: 950 [2025-03-17 05:54:03,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:03,853 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 94 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:03,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 263 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:54:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-03-17 05:54:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 944. [2025-03-17 05:54:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 799 states have (on average 1.3579474342928661) internal successors, (1085), 805 states have internal predecessors, (1085), 127 states have call successors, (127), 17 states have call predecessors, (127), 17 states have return successors, (127), 121 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 05:54:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1339 transitions. [2025-03-17 05:54:03,897 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1339 transitions. Word has length 130 [2025-03-17 05:54:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:03,897 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1339 transitions. [2025-03-17 05:54:03,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1339 transitions. [2025-03-17 05:54:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:54:03,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:03,899 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:54:03,899 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2076168378, now seen corresponding path program 1 times [2025-03-17 05:54:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471830098] [2025-03-17 05:54:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471830098] [2025-03-17 05:54:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471830098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:54:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274127726] [2025-03-17 05:54:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:04,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:54:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:54:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:04,897 INFO L87 Difference]: Start difference. First operand 944 states and 1339 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:05,544 INFO L93 Difference]: Finished difference Result 1942 states and 2749 transitions. [2025-03-17 05:54:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:54:05,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:54:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:05,548 INFO L225 Difference]: With dead ends: 1942 [2025-03-17 05:54:05,548 INFO L226 Difference]: Without dead ends: 1013 [2025-03-17 05:54:05,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:05,550 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 206 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:05,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 639 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:54:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-17 05:54:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1004. [2025-03-17 05:54:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 855 states have (on average 1.3590643274853802) internal successors, (1162), 862 states have internal predecessors, (1162), 129 states have call successors, (129), 19 states have call predecessors, (129), 19 states have return successors, (129), 122 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-17 05:54:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1420 transitions. [2025-03-17 05:54:05,588 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1420 transitions. Word has length 130 [2025-03-17 05:54:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:05,588 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1420 transitions. [2025-03-17 05:54:05,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1420 transitions. [2025-03-17 05:54:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:54:05,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:05,590 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:05,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:54:05,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1863857658, now seen corresponding path program 1 times [2025-03-17 05:54:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52768187] [2025-03-17 05:54:05,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:05,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:54:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:54:05,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52768187] [2025-03-17 05:54:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52768187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:54:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990815423] [2025-03-17 05:54:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:54:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:06,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:54:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:06,582 INFO L87 Difference]: Start difference. First operand 1004 states and 1420 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:07,367 INFO L93 Difference]: Finished difference Result 2004 states and 2827 transitions. [2025-03-17 05:54:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:54:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:54:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:07,372 INFO L225 Difference]: With dead ends: 2004 [2025-03-17 05:54:07,372 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 05:54:07,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:54:07,375 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 161 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:07,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 819 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:54:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 05:54:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 655. [2025-03-17 05:54:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 558 states have (on average 1.3476702508960574) internal successors, (752), 562 states have internal predecessors, (752), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:54:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 916 transitions. [2025-03-17 05:54:07,412 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 916 transitions. Word has length 130 [2025-03-17 05:54:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:07,412 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 916 transitions. [2025-03-17 05:54:07,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 916 transitions. [2025-03-17 05:54:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:54:07,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:07,414 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:07,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:54:07,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:07,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2072621440, now seen corresponding path program 1 times [2025-03-17 05:54:07,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:07,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587646468] [2025-03-17 05:54:07,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:07,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:54:07,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:54:07,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:07,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587646468] [2025-03-17 05:54:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587646468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:54:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144772148] [2025-03-17 05:54:07,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:54:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:07,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:54:07,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:54:07,523 INFO L87 Difference]: Start difference. First operand 655 states and 916 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:07,548 INFO L93 Difference]: Finished difference Result 951 states and 1336 transitions. [2025-03-17 05:54:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:54:07,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-17 05:54:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:07,553 INFO L225 Difference]: With dead ends: 951 [2025-03-17 05:54:07,553 INFO L226 Difference]: Without dead ends: 655 [2025-03-17 05:54:07,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:54:07,555 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:07,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:54:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-17 05:54:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-03-17 05:54:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 558 states have (on average 1.3458781362007168) internal successors, (751), 562 states have internal predecessors, (751), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:54:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 915 transitions. [2025-03-17 05:54:07,584 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 915 transitions. Word has length 131 [2025-03-17 05:54:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 915 transitions. [2025-03-17 05:54:07,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 915 transitions. [2025-03-17 05:54:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:54:07,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:07,587 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:07,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:54:07,587 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -977581375, now seen corresponding path program 1 times [2025-03-17 05:54:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645935012] [2025-03-17 05:54:07,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:07,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:54:07,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:54:07,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:07,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645935012] [2025-03-17 05:54:08,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645935012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:08,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:08,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:54:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52990540] [2025-03-17 05:54:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:08,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:54:08,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:08,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:54:08,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:08,063 INFO L87 Difference]: Start difference. First operand 655 states and 915 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:09,072 INFO L93 Difference]: Finished difference Result 1502 states and 2108 transitions. [2025-03-17 05:54:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:54:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-17 05:54:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:09,077 INFO L225 Difference]: With dead ends: 1502 [2025-03-17 05:54:09,077 INFO L226 Difference]: Without dead ends: 1206 [2025-03-17 05:54:09,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:54:09,079 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 283 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:09,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1685 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:54:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-03-17 05:54:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 941. [2025-03-17 05:54:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 807 states have (on average 1.3543990086741016) internal successors, (1093), 813 states have internal predecessors, (1093), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:54:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1321 transitions. [2025-03-17 05:54:09,117 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1321 transitions. Word has length 131 [2025-03-17 05:54:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:09,117 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1321 transitions. [2025-03-17 05:54:09,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1321 transitions. [2025-03-17 05:54:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:54:09,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:09,119 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:54:09,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash -946561568, now seen corresponding path program 1 times [2025-03-17 05:54:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256836455] [2025-03-17 05:54:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:09,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:54:09,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:54:09,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:09,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256836455] [2025-03-17 05:54:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256836455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174267714] [2025-03-17 05:54:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:09,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:09,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:09,737 INFO L87 Difference]: Start difference. First operand 941 states and 1321 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:10,435 INFO L93 Difference]: Finished difference Result 1470 states and 2066 transitions. [2025-03-17 05:54:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:54:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-17 05:54:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:10,439 INFO L225 Difference]: With dead ends: 1470 [2025-03-17 05:54:10,440 INFO L226 Difference]: Without dead ends: 888 [2025-03-17 05:54:10,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:54:10,443 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 346 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:10,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 942 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:54:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-17 05:54:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 878. [2025-03-17 05:54:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 747 states have (on average 1.3413654618473896) internal successors, (1002), 751 states have internal predecessors, (1002), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 05:54:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1226 transitions. [2025-03-17 05:54:10,474 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1226 transitions. Word has length 131 [2025-03-17 05:54:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1226 transitions. [2025-03-17 05:54:10,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1226 transitions. [2025-03-17 05:54:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:54:10,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:10,477 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:10,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:54:10,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:10,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1355385793, now seen corresponding path program 1 times [2025-03-17 05:54:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33179202] [2025-03-17 05:54:10,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:10,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:54:10,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:54:10,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33179202] [2025-03-17 05:54:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33179202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:11,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:54:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888730838] [2025-03-17 05:54:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:11,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:54:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:11,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:54:11,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:54:11,252 INFO L87 Difference]: Start difference. First operand 878 states and 1226 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:12,123 INFO L93 Difference]: Finished difference Result 1410 states and 1967 transitions. [2025-03-17 05:54:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:54:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-17 05:54:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:12,127 INFO L225 Difference]: With dead ends: 1410 [2025-03-17 05:54:12,127 INFO L226 Difference]: Without dead ends: 891 [2025-03-17 05:54:12,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:54:12,129 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 241 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:12,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1284 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:54:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-17 05:54:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 876. [2025-03-17 05:54:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 745 states have (on average 1.3409395973154363) internal successors, (999), 749 states have internal predecessors, (999), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 05:54:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1223 transitions. [2025-03-17 05:54:12,158 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1223 transitions. Word has length 131 [2025-03-17 05:54:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:12,158 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1223 transitions. [2025-03-17 05:54:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1223 transitions. [2025-03-17 05:54:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:54:12,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:12,159 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:12,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:54:12,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -595416169, now seen corresponding path program 1 times [2025-03-17 05:54:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688022713] [2025-03-17 05:54:12,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:12,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:54:12,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:54:12,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:12,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688022713] [2025-03-17 05:54:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688022713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:12,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:12,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433704707] [2025-03-17 05:54:12,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:12,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:12,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:12,386 INFO L87 Difference]: Start difference. First operand 876 states and 1223 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:12,967 INFO L93 Difference]: Finished difference Result 1165 states and 1626 transitions. [2025-03-17 05:54:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:54:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-17 05:54:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:12,973 INFO L225 Difference]: With dead ends: 1165 [2025-03-17 05:54:12,974 INFO L226 Difference]: Without dead ends: 877 [2025-03-17 05:54:12,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:12,975 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 250 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:12,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1050 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:54:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-17 05:54:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 871. [2025-03-17 05:54:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 740 states have (on average 1.337837837837838) internal successors, (990), 744 states have internal predecessors, (990), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 05:54:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1214 transitions. [2025-03-17 05:54:13,017 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1214 transitions. Word has length 132 [2025-03-17 05:54:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1214 transitions. [2025-03-17 05:54:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1214 transitions. [2025-03-17 05:54:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:54:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:13,019 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:13,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:54:13,020 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1625196823, now seen corresponding path program 1 times [2025-03-17 05:54:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694469487] [2025-03-17 05:54:13,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:13,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:54:13,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:54:13,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:13,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694469487] [2025-03-17 05:54:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694469487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:13,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378312316] [2025-03-17 05:54:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:13,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:13,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:13,225 INFO L87 Difference]: Start difference. First operand 871 states and 1214 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:13,830 INFO L93 Difference]: Finished difference Result 1106 states and 1538 transitions. [2025-03-17 05:54:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:54:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-17 05:54:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:13,834 INFO L225 Difference]: With dead ends: 1106 [2025-03-17 05:54:13,835 INFO L226 Difference]: Without dead ends: 823 [2025-03-17 05:54:13,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:13,836 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 237 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:13,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1183 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:54:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-17 05:54:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 615. [2025-03-17 05:54:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 521 states have (on average 1.3339731285988483) internal successors, (695), 523 states have internal predecessors, (695), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 855 transitions. [2025-03-17 05:54:13,858 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 855 transitions. Word has length 132 [2025-03-17 05:54:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:13,859 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 855 transitions. [2025-03-17 05:54:13,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 855 transitions. [2025-03-17 05:54:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:54:13,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:13,860 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:13,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:54:13,860 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:13,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1708156456, now seen corresponding path program 1 times [2025-03-17 05:54:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:13,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645317066] [2025-03-17 05:54:13,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:13,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:54:13,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:54:13,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:13,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645317066] [2025-03-17 05:54:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645317066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186340730] [2025-03-17 05:54:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:14,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:14,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:14,311 INFO L87 Difference]: Start difference. First operand 615 states and 855 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:14,535 INFO L93 Difference]: Finished difference Result 1302 states and 1805 transitions. [2025-03-17 05:54:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:14,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-17 05:54:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:14,538 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 05:54:14,538 INFO L226 Difference]: Without dead ends: 688 [2025-03-17 05:54:14,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:14,540 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 52 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:14,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 560 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:54:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-17 05:54:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 603. [2025-03-17 05:54:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 509 states have (on average 1.306483300589391) internal successors, (665), 511 states have internal predecessors, (665), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 825 transitions. [2025-03-17 05:54:14,561 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 825 transitions. Word has length 132 [2025-03-17 05:54:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:14,561 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 825 transitions. [2025-03-17 05:54:14,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:54:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2025-03-17 05:54:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:54:14,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:14,564 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:54:14,564 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1589738487, now seen corresponding path program 1 times [2025-03-17 05:54:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783513378] [2025-03-17 05:54:14,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:14,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:54:14,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:54:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783513378] [2025-03-17 05:54:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783513378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:54:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113033926] [2025-03-17 05:54:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:54:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:54:14,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:54:14,698 INFO L87 Difference]: Start difference. First operand 603 states and 825 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:14,799 INFO L93 Difference]: Finished difference Result 1138 states and 1557 transitions. [2025-03-17 05:54:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:54:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-17 05:54:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:14,804 INFO L225 Difference]: With dead ends: 1138 [2025-03-17 05:54:14,804 INFO L226 Difference]: Without dead ends: 688 [2025-03-17 05:54:14,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:14,806 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 90 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:14,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 383 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:54:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-17 05:54:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 603. [2025-03-17 05:54:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 509 states have (on average 1.300589390962672) internal successors, (662), 511 states have internal predecessors, (662), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 822 transitions. [2025-03-17 05:54:14,840 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 822 transitions. Word has length 132 [2025-03-17 05:54:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:14,840 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 822 transitions. [2025-03-17 05:54:14,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 822 transitions. [2025-03-17 05:54:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:54:14,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:14,841 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:14,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:54:14,841 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:14,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1835772038, now seen corresponding path program 1 times [2025-03-17 05:54:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815618530] [2025-03-17 05:54:14,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:14,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:54:14,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:54:14,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815618530] [2025-03-17 05:54:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815618530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:54:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3850396] [2025-03-17 05:54:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:15,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:54:15,072 INFO L87 Difference]: Start difference. First operand 603 states and 822 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:15,424 INFO L93 Difference]: Finished difference Result 1051 states and 1430 transitions. [2025-03-17 05:54:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:54:15,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-17 05:54:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:15,427 INFO L225 Difference]: With dead ends: 1051 [2025-03-17 05:54:15,427 INFO L226 Difference]: Without dead ends: 601 [2025-03-17 05:54:15,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:15,428 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 120 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:15,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 736 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:54:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-17 05:54:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2025-03-17 05:54:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 501 states have (on average 1.2934131736526946) internal successors, (648), 503 states have internal predecessors, (648), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 808 transitions. [2025-03-17 05:54:15,448 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 808 transitions. Word has length 134 [2025-03-17 05:54:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:15,448 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 808 transitions. [2025-03-17 05:54:15,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 808 transitions. [2025-03-17 05:54:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:54:15,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:15,449 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:54:15,449 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:15,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -388863175, now seen corresponding path program 1 times [2025-03-17 05:54:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166871817] [2025-03-17 05:54:15,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:15,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:54:15,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:54:15,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:15,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:54:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166871817] [2025-03-17 05:54:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166871817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:54:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196761510] [2025-03-17 05:54:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:15,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:54:15,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:54:15,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:54:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:54:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:54:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:15,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:54:15,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:54:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:15,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:54:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196761510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:54:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:54:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360999523] [2025-03-17 05:54:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:15,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:54:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:15,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:54:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:54:15,894 INFO L87 Difference]: Start difference. First operand 595 states and 808 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:15,948 INFO L93 Difference]: Finished difference Result 1213 states and 1645 transitions. [2025-03-17 05:54:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:54:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-17 05:54:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:15,951 INFO L225 Difference]: With dead ends: 1213 [2025-03-17 05:54:15,952 INFO L226 Difference]: Without dead ends: 619 [2025-03-17 05:54:15,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:54:15,953 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:15,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 696 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:54:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-17 05:54:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2025-03-17 05:54:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 525 states have (on average 1.28) internal successors, (672), 527 states have internal predecessors, (672), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 832 transitions. [2025-03-17 05:54:15,992 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 832 transitions. Word has length 135 [2025-03-17 05:54:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 832 transitions. [2025-03-17 05:54:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 832 transitions. [2025-03-17 05:54:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:54:15,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:15,993 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:16,001 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-17 05:54:16,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:16,194 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:16,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1307424465, now seen corresponding path program 1 times [2025-03-17 05:54:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937882539] [2025-03-17 05:54:16,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:54:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:54:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937882539] [2025-03-17 05:54:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937882539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:54:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634722518] [2025-03-17 05:54:16,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:54:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:54:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:16,310 INFO L87 Difference]: Start difference. First operand 619 states and 832 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:16,428 INFO L93 Difference]: Finished difference Result 1225 states and 1645 transitions. [2025-03-17 05:54:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:54:16,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-17 05:54:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:16,431 INFO L225 Difference]: With dead ends: 1225 [2025-03-17 05:54:16,431 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 05:54:16,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:54:16,432 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:16,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:54:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 05:54:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-17 05:54:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 513 states have (on average 1.263157894736842) internal successors, (648), 515 states have internal predecessors, (648), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:54:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 808 transitions. [2025-03-17 05:54:16,456 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 808 transitions. Word has length 135 [2025-03-17 05:54:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:16,457 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 808 transitions. [2025-03-17 05:54:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 808 transitions. [2025-03-17 05:54:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:54:16,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:16,458 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:16,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:54:16,458 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:16,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1042259881, now seen corresponding path program 1 times [2025-03-17 05:54:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349752090] [2025-03-17 05:54:16,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:54:16,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:54:16,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349752090] [2025-03-17 05:54:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349752090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102564948] [2025-03-17 05:54:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:16,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:16,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:16,705 INFO L87 Difference]: Start difference. First operand 607 states and 808 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:17,290 INFO L93 Difference]: Finished difference Result 1093 states and 1433 transitions. [2025-03-17 05:54:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-17 05:54:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:17,294 INFO L225 Difference]: With dead ends: 1093 [2025-03-17 05:54:17,294 INFO L226 Difference]: Without dead ends: 761 [2025-03-17 05:54:17,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:17,296 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 191 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:17,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 804 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:54:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-17 05:54:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 754. [2025-03-17 05:54:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 632 states have (on average 1.2325949367088607) internal successors, (779), 637 states have internal predecessors, (779), 101 states have call successors, (101), 20 states have call predecessors, (101), 20 states have return successors, (101), 96 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-17 05:54:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 981 transitions. [2025-03-17 05:54:17,335 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 981 transitions. Word has length 137 [2025-03-17 05:54:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:17,336 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 981 transitions. [2025-03-17 05:54:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 981 transitions. [2025-03-17 05:54:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:54:17,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:17,337 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:54:17,338 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1242603574, now seen corresponding path program 1 times [2025-03-17 05:54:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231061851] [2025-03-17 05:54:17,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:17,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:54:17,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:54:17,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:17,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231061851] [2025-03-17 05:54:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231061851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:17,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:54:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930839551] [2025-03-17 05:54:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:17,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:54:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:17,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:54:17,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:54:17,952 INFO L87 Difference]: Start difference. First operand 754 states and 981 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:18,570 INFO L93 Difference]: Finished difference Result 1648 states and 2128 transitions. [2025-03-17 05:54:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:54:18,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-17 05:54:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:18,575 INFO L225 Difference]: With dead ends: 1648 [2025-03-17 05:54:18,575 INFO L226 Difference]: Without dead ends: 895 [2025-03-17 05:54:18,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:54:18,577 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 148 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:18,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 618 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:54:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-17 05:54:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 889. [2025-03-17 05:54:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 742 states have (on average 1.2142857142857142) internal successors, (901), 750 states have internal predecessors, (901), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 05:54:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1141 transitions. [2025-03-17 05:54:18,615 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1141 transitions. Word has length 137 [2025-03-17 05:54:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:18,616 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1141 transitions. [2025-03-17 05:54:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1141 transitions. [2025-03-17 05:54:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:54:18,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:18,617 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:18,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:54:18,617 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:18,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash 860026796, now seen corresponding path program 1 times [2025-03-17 05:54:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124659246] [2025-03-17 05:54:18,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:18,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:18,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:54:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124659246] [2025-03-17 05:54:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124659246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:54:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:54:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:54:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808834070] [2025-03-17 05:54:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:54:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:54:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:54:18,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:54:18,913 INFO L87 Difference]: Start difference. First operand 889 states and 1141 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:19,210 INFO L93 Difference]: Finished difference Result 926 states and 1185 transitions. [2025-03-17 05:54:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:54:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-03-17 05:54:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:19,213 INFO L225 Difference]: With dead ends: 926 [2025-03-17 05:54:19,213 INFO L226 Difference]: Without dead ends: 924 [2025-03-17 05:54:19,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:54:19,214 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 107 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:19,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 964 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:54:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-17 05:54:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2025-03-17 05:54:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 775 states have (on average 1.201290322580645) internal successors, (931), 783 states have internal predecessors, (931), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 05:54:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1171 transitions. [2025-03-17 05:54:19,247 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1171 transitions. Word has length 138 [2025-03-17 05:54:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:19,247 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1171 transitions. [2025-03-17 05:54:19,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:54:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1171 transitions. [2025-03-17 05:54:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:54:19,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:19,248 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:19,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:54:19,248 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:19,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:19,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1323650131, now seen corresponding path program 1 times [2025-03-17 05:54:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:19,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541854510] [2025-03-17 05:54:19,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:19,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:19,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:19,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:54:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269705032] [2025-03-17 05:54:19,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:19,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:19,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:54:19,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:54:19,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:54:19,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:19,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:19,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:19,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:54:19,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 05:54:19,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:54:19,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2025-03-17 05:54:19,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 104 [2025-03-17 05:54:20,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 108 [2025-03-17 05:54:22,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 122 [2025-03-17 05:54:23,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 125 [2025-03-17 05:54:25,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 129 [2025-03-17 05:54:26,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 133 [2025-03-17 05:54:27,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 133 [2025-03-17 05:54:28,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 133 [2025-03-17 05:54:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 133 [2025-03-17 05:54:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 336 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-17 05:54:31,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:54:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:54:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541854510] [2025-03-17 05:54:34,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:54:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269705032] [2025-03-17 05:54:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269705032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:54:34,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:54:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-17 05:54:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319845658] [2025-03-17 05:54:34,102 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 05:54:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:54:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:54:34,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:54:34,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:54:34,103 INFO L87 Difference]: Start difference. First operand 922 states and 1171 transitions. Second operand has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 05:54:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:54:55,277 INFO L93 Difference]: Finished difference Result 1973 states and 2503 transitions. [2025-03-17 05:54:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:54:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 138 [2025-03-17 05:54:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:54:55,282 INFO L225 Difference]: With dead ends: 1973 [2025-03-17 05:54:55,282 INFO L226 Difference]: Without dead ends: 1052 [2025-03-17 05:54:55,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:54:55,288 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:54:55,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 740 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 19.8s Time] [2025-03-17 05:54:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-17 05:54:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1002. [2025-03-17 05:54:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 835 states have (on average 1.2047904191616767) internal successors, (1006), 843 states have internal predecessors, (1006), 135 states have call successors, (135), 31 states have call predecessors, (135), 31 states have return successors, (135), 127 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-17 05:54:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1276 transitions. [2025-03-17 05:54:55,331 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1276 transitions. Word has length 138 [2025-03-17 05:54:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:54:55,331 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1276 transitions. [2025-03-17 05:54:55,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 05:54:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1276 transitions. [2025-03-17 05:54:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:54:55,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:54:55,332 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:55,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:54:55,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 05:54:55,533 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:54:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:54:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1719508267, now seen corresponding path program 1 times [2025-03-17 05:54:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:54:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417502653] [2025-03-17 05:54:55,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:54:55,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:54:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361679244] [2025-03-17 05:54:55,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:54:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:54:55,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:54:55,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:54:55,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:56,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:56,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:56,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:54:56,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:54:56,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:54:56,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:54:56,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:54:56,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:54:56,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:54:56,448 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:54:56,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:54:56,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:54:56,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:54:56,655 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:54:56,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:54:56,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:54:56 BoogieIcfgContainer [2025-03-17 05:54:56,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:54:56,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:54:56,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:54:56,704 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:54:56,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:53:53" (3/4) ... [2025-03-17 05:54:56,706 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:54:56,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:54:56,707 INFO L158 Benchmark]: Toolchain (without parser) took 64493.61ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 78.1MB in the end (delta: 50.0MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2025-03-17 05:54:56,707 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:54:56,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.03ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 112.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:54:56,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.73ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 108.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:54:56,707 INFO L158 Benchmark]: Boogie Preprocessor took 45.60ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:54:56,708 INFO L158 Benchmark]: IcfgBuilder took 654.16ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 74.1MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:54:56,708 INFO L158 Benchmark]: TraceAbstraction took 63447.82ms. Allocated memory is still 167.8MB. Free memory was 73.7MB in the beginning and 78.1MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:54:56,708 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 167.8MB. Free memory was 78.1MB in the beginning and 78.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:54:56,708 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.03ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 112.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.73ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 108.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.60ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 654.16ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 74.1MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63447.82ms. Allocated memory is still 167.8MB. Free memory was 73.7MB in the beginning and 78.1MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 167.8MB. Free memory was 78.1MB in the beginning and 78.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L78] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] RET updateVariables() [L115] CALL step() [L56] EXPR WrapperStruct00.var_1_12 [L56] EXPR WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_14 [L56] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L56] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L56] COND FALSE !(((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_1 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_11 [L62] EXPR WrapperStruct00.var_1_6 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND FALSE !((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) [L65] WrapperStruct00.var_1_5 = 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR WrapperStruct00.var_1_11 [L67] unsigned char stepLocal_1 = WrapperStruct00.var_1_11; [L68] EXPR WrapperStruct00.var_1_2 [L68] unsigned char stepLocal_0 = WrapperStruct00.var_1_2; [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_11 [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L69] COND TRUE stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L70] EXPR WrapperStruct00.var_1_9 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L70] COND FALSE !(stepLocal_1 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_13 [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106-L107] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 174 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 30, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3568 SdHoareTripleChecker+Valid, 29.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3561 mSDsluCounter, 19706 SdHoareTripleChecker+Invalid, 27.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14826 mSDsCounter, 472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13285 IncrementalHoareTripleChecker+Invalid, 13757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 472 mSolverCounterUnsat, 4880 mSDtfsCounter, 13285 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1036 GetRequests, 821 SyntacticMatches, 4 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=13, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 1236 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 4617 NumberOfCodeBlocks, 4617 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4171 ConstructedInterpolants, 0 QuantifiedInterpolants, 25181 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1917 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 12992/13440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:54:56,919 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 05:54:57,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 32bit --witnessprinter.graph.data.programhash 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:54:58,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:54:58,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:54:58,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:54:58,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:54:58,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:54:58,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:54:58,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:54:58,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:54:58,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:54:58,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:54:58,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:54:58,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:54:58,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:54:58,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:54:58,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:54:58,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:54:58,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:54:58,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:54:58,703 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-03-17 05:54:58,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:54:58,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:54:58,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:54:58,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:54:58,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:54:58,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:55:00,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237c6fcf3/cc730f0d1c974ca8b7a954e37c84d9f0/FLAGff49f0b81 [2025-03-17 05:55:00,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:55:00,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:55:00,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237c6fcf3/cc730f0d1c974ca8b7a954e37c84d9f0/FLAGff49f0b81 [2025-03-17 05:55:00,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237c6fcf3/cc730f0d1c974ca8b7a954e37c84d9f0 [2025-03-17 05:55:00,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:55:00,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:55:00,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:55:00,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:55:00,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:55:00,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:00,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e70a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00, skipping insertion in model container [2025-03-17 05:55:00,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:00,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:55:00,842 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-03-17 05:55:00,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:55:00,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:55:00,921 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-03-17 05:55:00,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:55:00,984 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:55:00,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00 WrapperNode [2025-03-17 05:55:00,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:55:00,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:55:00,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:55:00,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:55:00,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,028 INFO L138 Inliner]: procedures = 34, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-03-17 05:55:01,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:55:01,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:55:01,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:55:01,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:55:01,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,057 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-17 05:55:01,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:55:01,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:55:01,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:55:01,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:55:01,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (1/1) ... [2025-03-17 05:55:01,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:55:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:01,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:55:01,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:55:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:55:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:55:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 05:55:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:55:01,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:55:01,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:55:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:55:01,245 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:55:01,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:55:11,393 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-03-17 05:55:11,418 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:55:11,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:55:11,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:55:11,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:55:11,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:55:11 BoogieIcfgContainer [2025-03-17 05:55:11,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:55:11,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:55:11,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:55:11,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:55:11,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:55:00" (1/3) ... [2025-03-17 05:55:11,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebd329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:55:11, skipping insertion in model container [2025-03-17 05:55:11,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:00" (2/3) ... [2025-03-17 05:55:11,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebd329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:55:11, skipping insertion in model container [2025-03-17 05:55:11,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:55:11" (3/3) ... [2025-03-17 05:55:11,437 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-03-17 05:55:11,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:55:11,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:55:11,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:55:11,502 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;@7b3b1e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:55:11,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:55:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:55:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:55:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:11,517 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:11,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 54266889, now seen corresponding path program 1 times [2025-03-17 05:55:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:55:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435317609] [2025-03-17 05:55:11,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:55:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:55:11,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:55:11,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:55:11,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:55:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:55:11,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:11,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:55:11,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:55:12,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:55:12,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:55:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435317609] [2025-03-17 05:55:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435317609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:55:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557634511] [2025-03-17 05:55:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:55:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:55:12,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:55:12,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:55:12,039 INFO L87 Difference]: Start difference. First operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:55:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:12,060 INFO L93 Difference]: Finished difference Result 209 states and 331 transitions. [2025-03-17 05:55:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:55:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-17 05:55:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:12,068 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:55:12,069 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:55:12,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:55:12,075 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:12,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:55:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:55:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:55:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:55:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2025-03-17 05:55:12,114 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 127 [2025-03-17 05:55:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:12,115 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2025-03-17 05:55:12,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:55:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2025-03-17 05:55:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:55:12,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:12,121 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:12,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:55:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:55:12,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 172654548, now seen corresponding path program 1 times [2025-03-17 05:55:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:55:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578482039] [2025-03-17 05:55:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:12,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:55:12,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:55:12,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:55:12,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:55:12,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:55:12,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:55:12,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:12,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:12,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:55:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:12,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 05:55:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:55:12,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:55:12,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:55:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578482039] [2025-03-17 05:55:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578482039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:55:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679516607] [2025-03-17 05:55:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:55:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:55:12,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:55:12,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:55:12,955 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:55:15,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []