./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.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 e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:49:47,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:49:47,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:49:47,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:49:47,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:49:47,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:49:47,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:49:47,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:49:47,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:49:47,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:49:47,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:49:47,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:49:47,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:49:47,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:49:47,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:49:47,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:49:47,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:47,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:49:47,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:49:47,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:49:47,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:49:47,506 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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2025-03-08 16:49:47,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:49:47,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:49:47,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:49:47,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:49:47,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:49:47,730 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-33.i [2025-03-08 16:49:48,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b77dee/2355e5746e084ce4914f09de043f40ff/FLAG61869ae24 [2025-03-08 16:49:49,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:49:49,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2025-03-08 16:49:49,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b77dee/2355e5746e084ce4914f09de043f40ff/FLAG61869ae24 [2025-03-08 16:49:49,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b77dee/2355e5746e084ce4914f09de043f40ff [2025-03-08 16:49:49,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:49:49,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:49:49,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:49,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:49:49,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:49:49,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add3508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49, skipping insertion in model container [2025-03-08 16:49:49,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:49:49,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2025-03-08 16:49:49,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:49,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:49:49,596 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-33.i[916,929] [2025-03-08 16:49:49,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:49,642 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:49:49,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49 WrapperNode [2025-03-08 16:49:49,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:49,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:49,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:49:49,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:49:49,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,681 INFO L138 Inliner]: procedures = 30, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2025-03-08 16:49:49,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:49,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:49:49,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:49:49,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:49:49,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,700 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:49:49,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:49:49,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:49:49,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:49:49,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:49:49,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (1/1) ... [2025-03-08 16:49:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:49,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:49:49,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:49:49,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:49:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:49:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:49:49,860 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:49:49,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:49:50,297 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~bitwise73#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~bitwise89#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite100#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2025-03-08 16:49:50,320 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-03-08 16:49:50,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:49:50,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:49:50,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:49:50,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:50 BoogieIcfgContainer [2025-03-08 16:49:50,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:49:50,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:49:50,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:49:50,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:49:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:49:49" (1/3) ... [2025-03-08 16:49:50,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3ef0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:50, skipping insertion in model container [2025-03-08 16:49:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:49" (2/3) ... [2025-03-08 16:49:50,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3ef0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:50, skipping insertion in model container [2025-03-08 16:49:50,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:50" (3/3) ... [2025-03-08 16:49:50,344 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2025-03-08 16:49:50,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:49:50,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-33.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:49:50,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:49:50,404 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;@3d278a28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:49:50,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:49:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:50,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:50,418 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:50,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:50,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1506569979, now seen corresponding path program 1 times [2025-03-08 16:49:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635450987] [2025-03-08 16:49:50,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:50,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 16:49:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635450987] [2025-03-08 16:49:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635450987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019972970] [2025-03-08 16:49:50,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:50,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:50,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:49:50,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:49:50,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:50,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:50,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:49:50,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 16:49:50,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019972970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:49:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:49:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427639336] [2025-03-08 16:49:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:50,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:49:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:50,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:49:50,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:49:50,887 INFO L87 Difference]: Start difference. First operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:50,912 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-03-08 16:49:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:49:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-08 16:49:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:50,917 INFO L225 Difference]: With dead ends: 206 [2025-03-08 16:49:50,918 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 16:49:50,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-08 16:49:50,921 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:50,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 16:49:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 16:49:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-08 16:49:50,951 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2025-03-08 16:49:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-08 16:49:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-08 16:49:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:50,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:50,954 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:50,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:49:51,155 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-08 16:49:51,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -404100026, now seen corresponding path program 1 times [2025-03-08 16:49:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-03-08 16:49:51,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:51,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:51,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-03-08 16:49:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877951663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:51,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:49:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315808672] [2025-03-08 16:49:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:51,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:49:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:51,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:49:51,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:49:51,393 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:51,448 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2025-03-08 16:49:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:49:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-08 16:49:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:51,452 INFO L225 Difference]: With dead ends: 205 [2025-03-08 16:49:51,452 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 16:49:51,453 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-08 16:49:51,453 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:51,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 16:49:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 16:49:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-08 16:49:51,466 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2025-03-08 16:49:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-08 16:49:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-08 16:49:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:51,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:51,469 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:51,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:49:51,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash -505011993, now seen corresponding path program 1 times [2025-03-08 16:49:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286107287] [2025-03-08 16:49:51,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:51,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:51,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:51,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286107287] [2025-03-08 16:49:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286107287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:49:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948624123] [2025-03-08 16:49:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:51,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:49:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:51,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:49:51,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:49:51,688 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:51,727 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2025-03-08 16:49:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:49:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:51,730 INFO L225 Difference]: With dead ends: 210 [2025-03-08 16:49:51,730 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:49:51,731 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-08 16:49:51,731 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:51,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:49:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-08 16:49:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-08 16:49:51,741 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2025-03-08 16:49:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-08 16:49:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-08 16:49:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:51,744 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:49:51,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 382491688, now seen corresponding path program 1 times [2025-03-08 16:49:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090306106] [2025-03-08 16:49:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:51,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:51,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090306106] [2025-03-08 16:49:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090306106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:51,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:51,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:49:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98649563] [2025-03-08 16:49:51,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:49:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:51,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:49:51,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:49:51,869 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:51,908 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2025-03-08 16:49:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:49:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:51,910 INFO L225 Difference]: With dead ends: 214 [2025-03-08 16:49:51,911 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 16:49:51,912 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-08 16:49:51,912 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:51,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 16:49:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-08 16:49:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-08 16:49:51,924 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 98 [2025-03-08 16:49:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:51,924 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-08 16:49:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-08 16:49:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:51,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:51,925 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:51,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:49:51,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:51,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 383415209, now seen corresponding path program 1 times [2025-03-08 16:49:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307528623] [2025-03-08 16:49:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:51,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:51,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:51,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:51,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307528623] [2025-03-08 16:49:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307528623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119169481] [2025-03-08 16:49:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:52,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:52,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:52,330 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:52,589 INFO L93 Difference]: Finished difference Result 323 states and 468 transitions. [2025-03-08 16:49:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:52,591 INFO L225 Difference]: With dead ends: 323 [2025-03-08 16:49:52,592 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 16:49:52,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 16:49:52,593 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 128 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:52,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 583 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 16:49:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 128. [2025-03-08 16:49:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-03-08 16:49:52,607 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2025-03-08 16:49:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:52,610 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-03-08 16:49:52,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-03-08 16:49:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:52,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:52,610 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:52,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:49:52,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1890967018, now seen corresponding path program 1 times [2025-03-08 16:49:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420391208] [2025-03-08 16:49:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:52,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:52,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420391208] [2025-03-08 16:49:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420391208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055860896] [2025-03-08 16:49:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:52,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:52,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:52,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:52,955 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:53,215 INFO L93 Difference]: Finished difference Result 299 states and 434 transitions. [2025-03-08 16:49:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:53,217 INFO L225 Difference]: With dead ends: 299 [2025-03-08 16:49:53,217 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 16:49:53,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-08 16:49:53,218 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 134 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:53,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 454 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 16:49:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 130. [2025-03-08 16:49:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2025-03-08 16:49:53,228 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 98 [2025-03-08 16:49:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2025-03-08 16:49:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2025-03-08 16:49:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:53,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:53,230 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:53,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:49:53,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:53,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1628179690, now seen corresponding path program 1 times [2025-03-08 16:49:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:53,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224827507] [2025-03-08 16:49:53,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:53,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:53,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:53,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:53,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224827507] [2025-03-08 16:49:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224827507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816087063] [2025-03-08 16:49:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:53,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:53,599 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:53,876 INFO L93 Difference]: Finished difference Result 305 states and 441 transitions. [2025-03-08 16:49:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:53,877 INFO L225 Difference]: With dead ends: 305 [2025-03-08 16:49:53,877 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 16:49:53,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:49:53,878 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 129 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:53,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 448 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 16:49:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2025-03-08 16:49:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:49:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2025-03-08 16:49:53,884 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 98 [2025-03-08 16:49:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:53,884 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2025-03-08 16:49:53,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2025-03-08 16:49:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:53,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:53,885 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:53,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:49:53,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1159235797, now seen corresponding path program 1 times [2025-03-08 16:49:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619674819] [2025-03-08 16:49:53,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:53,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:53,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:53,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:53,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:49:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619674819] [2025-03-08 16:49:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619674819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231676848] [2025-03-08 16:49:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:54,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:49:54,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:49:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:54,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:54,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:54,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:49:54,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:54,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2025-03-08 16:49:54,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:49:54,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2025-03-08 16:49:55,027 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 29 treesize of output 13 [2025-03-08 16:49:55,076 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 29 treesize of output 13 [2025-03-08 16:49:55,115 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 29 treesize of output 13 [2025-03-08 16:49:55,160 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 29 treesize of output 13 [2025-03-08 16:49:55,198 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 29 treesize of output 13 [2025-03-08 16:49:55,254 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 19 treesize of output 7 [2025-03-08 16:49:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:49:55,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:49:55,477 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 21 treesize of output 9 [2025-03-08 16:49:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:49:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231676848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:49:55,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:49:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2025-03-08 16:49:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290368263] [2025-03-08 16:49:55,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:49:55,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 16:49:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:55,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 16:49:55,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:49:55,513 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-08 16:49:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:56,489 INFO L93 Difference]: Finished difference Result 405 states and 577 transitions. [2025-03-08 16:49:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:49:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 98 [2025-03-08 16:49:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:56,490 INFO L225 Difference]: With dead ends: 405 [2025-03-08 16:49:56,490 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 16:49:56,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 16:49:56,492 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 618 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:56,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1145 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:49:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 16:49:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 183. [2025-03-08 16:49:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 160 states have (on average 1.375) internal successors, (220), 160 states have internal predecessors, (220), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:49:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 256 transitions. [2025-03-08 16:49:56,510 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 256 transitions. Word has length 98 [2025-03-08 16:49:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 256 transitions. [2025-03-08 16:49:56,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-08 16:49:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 256 transitions. [2025-03-08 16:49:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:49:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:56,511 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:56,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:49:56,712 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,SelfDestructingSolverStorable7 [2025-03-08 16:49:56,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -466134100, now seen corresponding path program 1 times [2025-03-08 16:49:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490064041] [2025-03-08 16:49:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:56,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:49:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:49:56,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:56,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490064041] [2025-03-08 16:49:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490064041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:49:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527845679] [2025-03-08 16:49:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:57,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:49:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:57,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:49:57,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:49:57,920 INFO L87 Difference]: Start difference. First operand 183 states and 256 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:58,366 INFO L93 Difference]: Finished difference Result 536 states and 764 transitions. [2025-03-08 16:49:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:49:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-08 16:49:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:58,369 INFO L225 Difference]: With dead ends: 536 [2025-03-08 16:49:58,369 INFO L226 Difference]: Without dead ends: 407 [2025-03-08 16:49:58,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:49:58,371 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 293 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:58,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 660 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:49:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-08 16:49:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 312. [2025-03-08 16:49:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 279 states have (on average 1.3978494623655915) internal successors, (390), 279 states have internal predecessors, (390), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:49:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 444 transitions. [2025-03-08 16:49:58,395 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 444 transitions. Word has length 98 [2025-03-08 16:49:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:58,395 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 444 transitions. [2025-03-08 16:49:58,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 444 transitions. [2025-03-08 16:49:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:49:58,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:58,396 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:58,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:49:58,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2103168083, now seen corresponding path program 1 times [2025-03-08 16:49:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544526650] [2025-03-08 16:49:58,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:58,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:49:58,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:49:58,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:58,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:58,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544526650] [2025-03-08 16:49:58,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544526650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:58,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:58,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868128454] [2025-03-08 16:49:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:58,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:58,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:58,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:58,533 INFO L87 Difference]: Start difference. First operand 312 states and 444 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:58,816 INFO L93 Difference]: Finished difference Result 764 states and 1095 transitions. [2025-03-08 16:49:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:58,817 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-08 16:49:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:58,820 INFO L225 Difference]: With dead ends: 764 [2025-03-08 16:49:58,821 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 16:49:58,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:58,822 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 117 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:58,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 598 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:49:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 16:49:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 340. [2025-03-08 16:49:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 307 states have (on average 1.4006514657980456) internal successors, (430), 307 states have internal predecessors, (430), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:49:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 484 transitions. [2025-03-08 16:49:58,851 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 484 transitions. Word has length 99 [2025-03-08 16:49:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 484 transitions. [2025-03-08 16:49:58,851 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 484 transitions. [2025-03-08 16:49:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:49:58,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:58,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:49:58,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 89268881, now seen corresponding path program 1 times [2025-03-08 16:49:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:58,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695829939] [2025-03-08 16:49:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:58,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:49:58,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:49:58,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:58,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:58,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695829939] [2025-03-08 16:49:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695829939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487730744] [2025-03-08 16:49:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:58,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:58,954 INFO L87 Difference]: Start difference. First operand 340 states and 484 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:59,176 INFO L93 Difference]: Finished difference Result 792 states and 1133 transitions. [2025-03-08 16:49:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:49:59,176 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-08 16:49:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:59,178 INFO L225 Difference]: With dead ends: 792 [2025-03-08 16:49:59,178 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 16:49:59,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-08 16:49:59,179 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 132 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:59,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 471 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 16:49:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 340. [2025-03-08 16:49:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 307 states have (on average 1.3876221498371335) internal successors, (426), 307 states have internal predecessors, (426), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:49:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2025-03-08 16:49:59,193 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 99 [2025-03-08 16:49:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:59,193 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2025-03-08 16:49:59,194 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2025-03-08 16:49:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:49:59,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:59,194 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:49:59,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:59,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2076507178, now seen corresponding path program 1 times [2025-03-08 16:49:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380640570] [2025-03-08 16:49:59,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:59,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:49:59,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:49:59,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:59,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:49:59,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380640570] [2025-03-08 16:49:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380640570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:59,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:59,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808218309] [2025-03-08 16:49:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:59,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:59,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:59,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:59,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:59,555 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:59,760 INFO L93 Difference]: Finished difference Result 727 states and 1036 transitions. [2025-03-08 16:49:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-08 16:49:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:59,762 INFO L225 Difference]: With dead ends: 727 [2025-03-08 16:49:59,762 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 16:49:59,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:59,763 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 71 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:59,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 396 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 16:49:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 407. [2025-03-08 16:49:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 374 states have (on average 1.3983957219251337) internal successors, (523), 374 states have internal predecessors, (523), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:49:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 577 transitions. [2025-03-08 16:49:59,775 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 577 transitions. Word has length 100 [2025-03-08 16:49:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 577 transitions. [2025-03-08 16:49:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 577 transitions. [2025-03-08 16:49:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:49:59,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:59,780 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:59,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:49:59,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:59,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1570948553, now seen corresponding path program 1 times [2025-03-08 16:49:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:59,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062596819] [2025-03-08 16:49:59,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:49:59,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:49:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:49:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062596819] [2025-03-08 16:49:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062596819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634768304] [2025-03-08 16:49:59,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:59,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:59,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:49:59,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:50:00,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:50:00,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:50:00,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:00,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:50:00,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:00,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634768304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:00,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:50:00,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:50:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835184411] [2025-03-08 16:50:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:00,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:00,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:00,064 INFO L87 Difference]: Start difference. First operand 407 states and 577 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:00,104 INFO L93 Difference]: Finished difference Result 765 states and 1092 transitions. [2025-03-08 16:50:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-08 16:50:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:00,107 INFO L225 Difference]: With dead ends: 765 [2025-03-08 16:50:00,107 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 16:50:00,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:00,108 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:00,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 16:50:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-08 16:50:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.3931398416886545) internal successors, (528), 379 states have internal predecessors, (528), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 582 transitions. [2025-03-08 16:50:00,138 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 582 transitions. Word has length 100 [2025-03-08 16:50:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 582 transitions. [2025-03-08 16:50:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 582 transitions. [2025-03-08 16:50:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:50:00,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:00,139 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:00,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:00,340 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:00,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -646624177, now seen corresponding path program 1 times [2025-03-08 16:50:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462094826] [2025-03-08 16:50:00,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:00,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:50:00,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:50:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:00,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462094826] [2025-03-08 16:50:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462094826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:00,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:00,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:00,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413628592] [2025-03-08 16:50:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:00,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:00,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:00,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:00,807 INFO L87 Difference]: Start difference. First operand 412 states and 582 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:00,960 INFO L93 Difference]: Finished difference Result 772 states and 1096 transitions. [2025-03-08 16:50:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:00,961 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-08 16:50:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:00,962 INFO L225 Difference]: With dead ends: 772 [2025-03-08 16:50:00,962 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 16:50:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-08 16:50:00,963 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 108 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:00,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 269 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 16:50:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-03-08 16:50:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.3905013192612137) internal successors, (527), 379 states have internal predecessors, (527), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2025-03-08 16:50:00,974 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 100 [2025-03-08 16:50:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:00,974 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2025-03-08 16:50:00,974 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2025-03-08 16:50:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:50:00,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:00,975 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:50:00,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:00,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash -729312976, now seen corresponding path program 1 times [2025-03-08 16:50:00,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:00,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433560288] [2025-03-08 16:50:00,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:00,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:50:00,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:50:00,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:00,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433560288] [2025-03-08 16:50:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433560288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021176909] [2025-03-08 16:50:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:01,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:01,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:01,490 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:01,709 INFO L93 Difference]: Finished difference Result 772 states and 1094 transitions. [2025-03-08 16:50:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-08 16:50:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:01,711 INFO L225 Difference]: With dead ends: 772 [2025-03-08 16:50:01,711 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 16:50:01,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:01,712 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 107 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:01,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 16:50:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-03-08 16:50:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.3852242744063326) internal successors, (525), 379 states have internal predecessors, (525), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 579 transitions. [2025-03-08 16:50:01,727 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 579 transitions. Word has length 101 [2025-03-08 16:50:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 579 transitions. [2025-03-08 16:50:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 579 transitions. [2025-03-08 16:50:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:50:01,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:01,728 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:50:01,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1654916217, now seen corresponding path program 1 times [2025-03-08 16:50:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423380288] [2025-03-08 16:50:01,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:01,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:50:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:50:01,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:01,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423380288] [2025-03-08 16:50:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423380288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:02,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:50:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886835113] [2025-03-08 16:50:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:50:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:02,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:50:02,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:02,035 INFO L87 Difference]: Start difference. First operand 412 states and 579 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:02,845 INFO L93 Difference]: Finished difference Result 1434 states and 2040 transitions. [2025-03-08 16:50:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:50:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-03-08 16:50:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:02,850 INFO L225 Difference]: With dead ends: 1434 [2025-03-08 16:50:02,850 INFO L226 Difference]: Without dead ends: 1076 [2025-03-08 16:50:02,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:50:02,851 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 356 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:02,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 997 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:50:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-08 16:50:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 501. [2025-03-08 16:50:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 468 states have (on average 1.420940170940171) internal successors, (665), 468 states have internal predecessors, (665), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 719 transitions. [2025-03-08 16:50:02,866 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 719 transitions. Word has length 103 [2025-03-08 16:50:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:02,867 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 719 transitions. [2025-03-08 16:50:02,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 719 transitions. [2025-03-08 16:50:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:50:02,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:02,868 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:50:02,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:02,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1233769650, now seen corresponding path program 1 times [2025-03-08 16:50:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:02,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919958113] [2025-03-08 16:50:02,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:02,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:50:02,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:50:02,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:02,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919958113] [2025-03-08 16:50:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919958113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:50:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009100248] [2025-03-08 16:50:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:50:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:03,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:50:03,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:03,369 INFO L87 Difference]: Start difference. First operand 501 states and 719 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:03,911 INFO L93 Difference]: Finished difference Result 1041 states and 1494 transitions. [2025-03-08 16:50:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:50:03,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-03-08 16:50:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:03,913 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 16:50:03,913 INFO L226 Difference]: Without dead ends: 574 [2025-03-08 16:50:03,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:50:03,915 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 394 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:03,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 658 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:50:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-08 16:50:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 464. [2025-03-08 16:50:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 431 states have (on average 1.4013921113689096) internal successors, (604), 431 states have internal predecessors, (604), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 658 transitions. [2025-03-08 16:50:03,926 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 658 transitions. Word has length 103 [2025-03-08 16:50:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:03,927 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 658 transitions. [2025-03-08 16:50:03,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 658 transitions. [2025-03-08 16:50:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:50:03,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:03,927 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:03,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:50:03,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1765695523, now seen corresponding path program 1 times [2025-03-08 16:50:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85811483] [2025-03-08 16:50:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:03,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:50:03,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:50:03,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:03,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:50:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85811483] [2025-03-08 16:50:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85811483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114379495] [2025-03-08 16:50:04,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:04,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:04,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:50:04,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:50:04,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:50:04,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:04,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:04,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:50:04,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:04,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114379495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:04,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:50:04,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:50:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932524116] [2025-03-08 16:50:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:04,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:04,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:04,247 INFO L87 Difference]: Start difference. First operand 464 states and 658 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:04,283 INFO L93 Difference]: Finished difference Result 880 states and 1255 transitions. [2025-03-08 16:50:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-08 16:50:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:04,285 INFO L225 Difference]: With dead ends: 880 [2025-03-08 16:50:04,285 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 16:50:04,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:04,287 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:04,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 16:50:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-08 16:50:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 437 states have (on average 1.3958810068649885) internal successors, (610), 437 states have internal predecessors, (610), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 16:50:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 664 transitions. [2025-03-08 16:50:04,307 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 664 transitions. Word has length 104 [2025-03-08 16:50:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:04,308 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 664 transitions. [2025-03-08 16:50:04,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 664 transitions. [2025-03-08 16:50:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:50:04,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:04,309 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:04,316 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-08 16:50:04,514 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,SelfDestructingSolverStorable17 [2025-03-08 16:50:04,514 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:04,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -224245473, now seen corresponding path program 1 times [2025-03-08 16:50:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564372798] [2025-03-08 16:50:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:50:04,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:50:04,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:04,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564372798] [2025-03-08 16:50:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564372798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:50:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994733050] [2025-03-08 16:50:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:04,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:50:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:04,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:50:04,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:04,819 INFO L87 Difference]: Start difference. First operand 470 states and 664 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:05,690 INFO L93 Difference]: Finished difference Result 1677 states and 2387 transitions. [2025-03-08 16:50:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:50:05,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-08 16:50:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:05,695 INFO L225 Difference]: With dead ends: 1677 [2025-03-08 16:50:05,695 INFO L226 Difference]: Without dead ends: 1261 [2025-03-08 16:50:05,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:50:05,696 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 331 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:05,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1104 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:50:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-08 16:50:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 873. [2025-03-08 16:50:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 820 states have (on average 1.3902439024390243) internal successors, (1140), 820 states have internal predecessors, (1140), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1230 transitions. [2025-03-08 16:50:05,728 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1230 transitions. Word has length 104 [2025-03-08 16:50:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:05,728 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1230 transitions. [2025-03-08 16:50:05,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1230 transitions. [2025-03-08 16:50:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:50:05,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:05,729 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:05,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:50:05,729 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:05,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1005385218, now seen corresponding path program 1 times [2025-03-08 16:50:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258371048] [2025-03-08 16:50:05,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:05,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:50:05,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:50:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:05,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258371048] [2025-03-08 16:50:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258371048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:50:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315088163] [2025-03-08 16:50:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:50:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:06,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:50:06,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:06,022 INFO L87 Difference]: Start difference. First operand 873 states and 1230 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:06,899 INFO L93 Difference]: Finished difference Result 1796 states and 2520 transitions. [2025-03-08 16:50:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:50:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-03-08 16:50:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:06,903 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 16:50:06,903 INFO L226 Difference]: Without dead ends: 1478 [2025-03-08 16:50:06,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:50:06,904 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 318 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:06,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1495 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:50:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-03-08 16:50:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 908. [2025-03-08 16:50:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 855 states have (on average 1.3871345029239766) internal successors, (1186), 855 states have internal predecessors, (1186), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1276 transitions. [2025-03-08 16:50:06,929 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1276 transitions. Word has length 104 [2025-03-08 16:50:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:06,929 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1276 transitions. [2025-03-08 16:50:06,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1276 transitions. [2025-03-08 16:50:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 16:50:06,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:06,930 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:06,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:50:06,930 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:06,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 111936947, now seen corresponding path program 1 times [2025-03-08 16:50:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126091157] [2025-03-08 16:50:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 16:50:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 16:50:06,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:06,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:07,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126091157] [2025-03-08 16:50:07,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126091157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:07,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:50:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346537632] [2025-03-08 16:50:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:50:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:07,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:50:07,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:07,231 INFO L87 Difference]: Start difference. First operand 908 states and 1276 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:07,723 INFO L93 Difference]: Finished difference Result 1843 states and 2602 transitions. [2025-03-08 16:50:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:50:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2025-03-08 16:50:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:07,726 INFO L225 Difference]: With dead ends: 1843 [2025-03-08 16:50:07,726 INFO L226 Difference]: Without dead ends: 989 [2025-03-08 16:50:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:50:07,727 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 240 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:07,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 648 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:50:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-08 16:50:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 845. [2025-03-08 16:50:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 792 states have (on average 1.3876262626262625) internal successors, (1099), 792 states have internal predecessors, (1099), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1189 transitions. [2025-03-08 16:50:07,749 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1189 transitions. Word has length 105 [2025-03-08 16:50:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:07,749 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1189 transitions. [2025-03-08 16:50:07,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1189 transitions. [2025-03-08 16:50:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 16:50:07,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:07,750 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:50:07,751 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1995565918, now seen corresponding path program 1 times [2025-03-08 16:50:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086515567] [2025-03-08 16:50:07,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:07,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 16:50:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 16:50:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:08,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086515567] [2025-03-08 16:50:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086515567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:50:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023624245] [2025-03-08 16:50:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:50:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:08,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:50:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:50:08,013 INFO L87 Difference]: Start difference. First operand 845 states and 1189 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:08,637 INFO L93 Difference]: Finished difference Result 2125 states and 2999 transitions. [2025-03-08 16:50:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:50:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2025-03-08 16:50:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:08,643 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 16:50:08,643 INFO L226 Difference]: Without dead ends: 1334 [2025-03-08 16:50:08,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:50:08,645 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 446 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:08,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 817 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:50:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-03-08 16:50:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 957. [2025-03-08 16:50:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 904 states have (on average 1.3971238938053097) internal successors, (1263), 904 states have internal predecessors, (1263), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1353 transitions. [2025-03-08 16:50:08,669 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1353 transitions. Word has length 105 [2025-03-08 16:50:08,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1353 transitions. [2025-03-08 16:50:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1353 transitions. [2025-03-08 16:50:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 16:50:08,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:08,670 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:08,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:50:08,671 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash -907511009, now seen corresponding path program 1 times [2025-03-08 16:50:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422272489] [2025-03-08 16:50:08,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:08,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 16:50:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 16:50:08,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:08,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422272489] [2025-03-08 16:50:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422272489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:08,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:50:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352154581] [2025-03-08 16:50:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:08,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:50:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:08,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:50:08,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:50:08,725 INFO L87 Difference]: Start difference. First operand 957 states and 1353 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:08,755 INFO L93 Difference]: Finished difference Result 1864 states and 2645 transitions. [2025-03-08 16:50:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:50:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2025-03-08 16:50:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:08,761 INFO L225 Difference]: With dead ends: 1864 [2025-03-08 16:50:08,761 INFO L226 Difference]: Without dead ends: 961 [2025-03-08 16:50:08,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:50:08,762 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:08,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-03-08 16:50:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-03-08 16:50:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 908 states have (on average 1.395374449339207) internal successors, (1267), 908 states have internal predecessors, (1267), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1357 transitions. [2025-03-08 16:50:08,790 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1357 transitions. Word has length 106 [2025-03-08 16:50:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1357 transitions. [2025-03-08 16:50:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1357 transitions. [2025-03-08 16:50:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 16:50:08,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:08,791 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:50:08,791 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 265904409, now seen corresponding path program 1 times [2025-03-08 16:50:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:08,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114634336] [2025-03-08 16:50:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:08,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 16:50:08,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 16:50:08,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:08,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114634336] [2025-03-08 16:50:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114634336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:50:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719821160] [2025-03-08 16:50:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:50:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:09,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:50:09,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:50:09,732 INFO L87 Difference]: Start difference. First operand 961 states and 1357 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:10,229 INFO L93 Difference]: Finished difference Result 972 states and 1368 transitions. [2025-03-08 16:50:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:50:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2025-03-08 16:50:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:10,232 INFO L225 Difference]: With dead ends: 972 [2025-03-08 16:50:10,232 INFO L226 Difference]: Without dead ends: 970 [2025-03-08 16:50:10,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:50:10,232 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 236 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:10,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 887 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:50:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-03-08 16:50:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 967. [2025-03-08 16:50:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 914 states have (on average 1.3927789934354486) internal successors, (1273), 914 states have internal predecessors, (1273), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:50:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1363 transitions. [2025-03-08 16:50:10,251 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1363 transitions. Word has length 106 [2025-03-08 16:50:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:10,251 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1363 transitions. [2025-03-08 16:50:10,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1363 transitions. [2025-03-08 16:50:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 16:50:10,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:10,252 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:10,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:50:10,252 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 266827930, now seen corresponding path program 1 times [2025-03-08 16:50:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877238898] [2025-03-08 16:50:10,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:10,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 16:50:10,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 16:50:10,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:10,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:50:10,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:50:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 16:50:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 16:50:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:50:10,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:50:10,343 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:50:10,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:50:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:50:10,348 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] [2025-03-08 16:50:10,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:50:10,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:50:10 BoogieIcfgContainer [2025-03-08 16:50:10,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:50:10,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:50:10,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:50:10,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:50:10,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:50" (3/4) ... [2025-03-08 16:50:10,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:50:10,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:50:10,406 INFO L158 Benchmark]: Toolchain (without parser) took 20972.80ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 122.4MB in the beginning and 357.9MB in the end (delta: -235.5MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,406 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:50:10,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.99ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 106.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:50:10,407 INFO L158 Benchmark]: Boogie Preprocessor took 37.88ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,407 INFO L158 Benchmark]: IcfgBuilder took 612.09ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 63.4MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,407 INFO L158 Benchmark]: TraceAbstraction took 20064.24ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 63.0MB in the beginning and 358.1MB in the end (delta: -295.0MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,407 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 570.4MB. Free memory was 358.1MB in the beginning and 357.9MB in the end (delta: 179.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:50:10,408 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.64ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.99ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 106.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.88ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 612.09ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 63.4MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20064.24ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 63.0MB in the beginning and 358.1MB in the end (delta: -295.0MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 570.4MB. Free memory was 358.1MB in the beginning and 357.9MB in the end (delta: 179.9kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_13 [L98] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L81] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L82] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L84] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L91] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L109] RET updateVariables() [L110] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L55] COND FALSE !(WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) [L58] EXPR WrapperStruct00.var_1_7 [L58] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_7 [L59] EXPR WrapperStruct00.var_1_7 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_7; [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L60] COND TRUE ! WrapperStruct00.var_1_14 [L61] EXPR WrapperStruct00.var_1_8 [L61] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_11 [L69] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_16 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16; [L71] COND FALSE !(stepLocal_0 < -1) [L74] EXPR WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_1 = (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) [L101] EXPR WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_11 [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101-L102] return ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 165 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4160 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4160 mSDsluCounter, 14734 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11332 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10739 IncrementalHoareTripleChecker+Invalid, 11394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 3402 mSDtfsCounter, 10739 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=967occurred in iteration=24, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2927 NumberOfCodeBlocks, 2927 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2890 ConstructedInterpolants, 0 QuantifiedInterpolants, 8918 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 4052/4176 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-08 16:50:10,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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-33.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 e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:50:12,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:50:12,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:50:12,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:50:12,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:50:12,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:50:12,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:50:12,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:50:12,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:50:12,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:50:12,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:50:12,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:50:12,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:50:12,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:50:12,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:50:12,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:50:12,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:50:12,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:50:12,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:12,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:50:12,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:50:12,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:50:12,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:50:12,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:50:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:50:12,393 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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2025-03-08 16:50:12,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:50:12,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:50:12,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:50:12,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:50:12,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:50:12,622 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-33.i [2025-03-08 16:50:13,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb0dfef7/da90fe2d5bd7443892ffd54cbc529b40/FLAGd76d17d7d [2025-03-08 16:50:13,953 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:50:13,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2025-03-08 16:50:13,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb0dfef7/da90fe2d5bd7443892ffd54cbc529b40/FLAGd76d17d7d [2025-03-08 16:50:14,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb0dfef7/da90fe2d5bd7443892ffd54cbc529b40 [2025-03-08 16:50:14,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:50:14,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:50:14,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:14,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:50:14,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:50:14,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfdffeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14, skipping insertion in model container [2025-03-08 16:50:14,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:50:14,446 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-33.i[916,929] [2025-03-08 16:50:14,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:14,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:50:14,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2025-03-08 16:50:14,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:14,569 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:50:14,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14 WrapperNode [2025-03-08 16:50:14,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:14,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:14,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:50:14,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:50:14,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,619 INFO L138 Inliner]: procedures = 37, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2025-03-08 16:50:14,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:14,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:50:14,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:50:14,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:50:14,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,664 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 28 writes are split as follows [0, 28]. [2025-03-08 16:50:14,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:50:14,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:50:14,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:50:14,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:50:14,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (1/1) ... [2025-03-08 16:50:14,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:14,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:50:14,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:50:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 16:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:50:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:50:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:50:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:50:14,845 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:50:14,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:50:18,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite75#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite94#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short97#1;havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short116#1; [2025-03-08 16:50:18,429 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-08 16:50:18,430 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:50:18,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:50:18,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:50:18,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:18 BoogieIcfgContainer [2025-03-08 16:50:18,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:50:18,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:50:18,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:50:18,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:50:18,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:50:14" (1/3) ... [2025-03-08 16:50:18,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0bc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:18, skipping insertion in model container [2025-03-08 16:50:18,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:14" (2/3) ... [2025-03-08 16:50:18,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0bc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:18, skipping insertion in model container [2025-03-08 16:50:18,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:18" (3/3) ... [2025-03-08 16:50:18,457 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2025-03-08 16:50:18,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:50:18,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-33.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:50:18,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:50:18,509 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;@66125140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:50:18,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:50:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 16:50:18,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:18,517 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:18,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -387161175, now seen corresponding path program 1 times [2025-03-08 16:50:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225822532] [2025-03-08 16:50:18,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:18,528 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-08 16:50:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:18,530 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-08 16:50:18,532 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-08 16:50:18,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 16:50:18,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 16:50:18,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:18,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:50:18,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 16:50:18,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:18,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225822532] [2025-03-08 16:50:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225822532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:18,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:18,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:50:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625283805] [2025-03-08 16:50:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:50:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:18,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:50:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:50:18,789 INFO L87 Difference]: Start difference. First operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:18,808 INFO L93 Difference]: Finished difference Result 162 states and 244 transitions. [2025-03-08 16:50:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:50:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-08 16:50:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:18,813 INFO L225 Difference]: With dead ends: 162 [2025-03-08 16:50:18,813 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 16:50:18,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-08 16:50:18,819 INFO L435 NwaCegarLoop]: 115 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, 115 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-08 16:50:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 16:50:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 16:50:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-08 16:50:18,849 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2025-03-08 16:50:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:18,849 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-08 16:50:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-08 16:50:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 16:50:18,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:18,851 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:18,858 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:19,052 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-08 16:50:19,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:19,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1549042602, now seen corresponding path program 1 times [2025-03-08 16:50:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207364204] [2025-03-08 16:50:19,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:19,053 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-08 16:50:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:19,056 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-08 16:50:19,056 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-08 16:50:19,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 16:50:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 16:50:19,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:19,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:19,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:50:19,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 16:50:19,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:19,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207364204] [2025-03-08 16:50:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207364204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529710811] [2025-03-08 16:50:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:19,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:19,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:19,352 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:19,400 INFO L93 Difference]: Finished difference Result 161 states and 230 transitions. [2025-03-08 16:50:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-08 16:50:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:19,404 INFO L225 Difference]: With dead ends: 161 [2025-03-08 16:50:19,405 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 16:50:19,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 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-08 16:50:19,406 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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-08 16:50:19,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 16:50:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 16:50:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-03-08 16:50:19,416 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 92 [2025-03-08 16:50:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:19,417 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-03-08 16:50:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-03-08 16:50:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 16:50:19,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:19,418 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:19,425 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 (3)] Ended with exit code 0 [2025-03-08 16:50:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 16:50:19,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:19,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1045184215, now seen corresponding path program 1 times [2025-03-08 16:50:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448653691] [2025-03-08 16:50:19,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:19,621 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-08 16:50:19,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:19,623 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 16:50:19,625 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 (4)] Waiting until timeout for monitored process [2025-03-08 16:50:19,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 16:50:19,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 16:50:19,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:19,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:19,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:50:19,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:19,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:19,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448653691] [2025-03-08 16:50:19,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448653691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:19,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:19,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:50:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443837399] [2025-03-08 16:50:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:19,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:19,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:19,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:19,872 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:19,935 INFO L93 Difference]: Finished difference Result 170 states and 241 transitions. [2025-03-08 16:50:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-08 16:50:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:19,937 INFO L225 Difference]: With dead ends: 170 [2025-03-08 16:50:19,937 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 16:50:19,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:19,938 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:19,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 16:50:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-08 16:50:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-03-08 16:50:19,948 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 92 [2025-03-08 16:50:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:19,948 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-03-08 16:50:19,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-03-08 16:50:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 16:50:19,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:19,951 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:19,958 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-08 16:50:20,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -157680534, now seen corresponding path program 1 times [2025-03-08 16:50:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231927274] [2025-03-08 16:50:20,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:20,153 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-08 16:50:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:20,155 INFO L229 MonitoredProcess]: Starting monitored process 5 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-08 16:50:20,157 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 (5)] Waiting until timeout for monitored process [2025-03-08 16:50:20,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 16:50:20,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 16:50:20,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:20,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:20,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:50:20,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:20,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:20,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:20,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231927274] [2025-03-08 16:50:20,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231927274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:20,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:50:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328464732] [2025-03-08 16:50:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:50:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:20,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:50:20,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:20,395 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:20,481 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2025-03-08 16:50:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:50:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-08 16:50:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:20,483 INFO L225 Difference]: With dead ends: 178 [2025-03-08 16:50:20,483 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 16:50:20,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:20,484 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:20,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 16:50:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-08 16:50:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-03-08 16:50:20,488 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 92 [2025-03-08 16:50:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:20,488 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-03-08 16:50:20,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:50:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-03-08 16:50:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 16:50:20,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:20,490 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:20,496 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 (5)] Ended with exit code 0 [2025-03-08 16:50:20,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 16:50:20,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:20,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash -156757013, now seen corresponding path program 1 times [2025-03-08 16:50:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439925329] [2025-03-08 16:50:20,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:20,696 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-08 16:50:20,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:20,698 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 16:50:20,699 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 (6)] Waiting until timeout for monitored process [2025-03-08 16:50:20,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 16:50:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 16:50:20,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:20,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:20,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:50:20,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:21,006 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 95 treesize of output 41 [2025-03-08 16:50:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 16:50:21,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:21,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439925329] [2025-03-08 16:50:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439925329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:21,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075662746] [2025-03-08 16:50:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:21,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:21,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:21,032 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:23,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:25,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:25,868 INFO L93 Difference]: Finished difference Result 180 states and 248 transitions. [2025-03-08 16:50:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:50:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-08 16:50:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:25,870 INFO L225 Difference]: With dead ends: 180 [2025-03-08 16:50:25,870 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 16:50:25,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:50:25,872 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 16:50:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 16:50:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-08 16:50:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-03-08 16:50:25,878 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 92 [2025-03-08 16:50:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:25,878 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-03-08 16:50:25,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-03-08 16:50:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 16:50:25,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:25,879 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:25,886 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 (6)] Ended with exit code 0 [2025-03-08 16:50:26,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-08 16:50:26,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -178548115, now seen corresponding path program 1 times [2025-03-08 16:50:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286946063] [2025-03-08 16:50:26,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:26,080 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-08 16:50:26,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:26,082 INFO L229 MonitoredProcess]: Starting monitored process 7 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-08 16:50:26,083 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 (7)] Waiting until timeout for monitored process [2025-03-08 16:50:26,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 16:50:26,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 16:50:26,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:26,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:26,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:50:26,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:26,407 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 95 treesize of output 41 [2025-03-08 16:50:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 16:50:26,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:26,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286946063] [2025-03-08 16:50:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286946063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199047934] [2025-03-08 16:50:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:26,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:26,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:26,429 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:30,261 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2025-03-08 16:50:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:50:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-03-08 16:50:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:30,262 INFO L225 Difference]: With dead ends: 179 [2025-03-08 16:50:30,262 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:50:30,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:50:30,263 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 81 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:30,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 325 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 16:50:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:50:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-08 16:50:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-03-08 16:50:30,267 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 94 [2025-03-08 16:50:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-03-08 16:50:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:50:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-03-08 16:50:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:50:30,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:30,269 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:30,275 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 (7)] Ended with exit code 0 [2025-03-08 16:50:30,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-08 16:50:30,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:30,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash -530055380, now seen corresponding path program 1 times [2025-03-08 16:50:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:30,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037867554] [2025-03-08 16:50:30,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:30,470 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-08 16:50:30,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:30,473 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 16:50:30,474 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 (8)] Waiting until timeout for monitored process [2025-03-08 16:50:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:50:30,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:50:30,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:30,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:30,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:50:30,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:30,833 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 94 treesize of output 40 [2025-03-08 16:50:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 16:50:30,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:31,075 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 58 treesize of output 22 [2025-03-08 16:50:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:50:31,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037867554] [2025-03-08 16:50:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037867554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:50:31,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:50:31,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-08 16:50:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510525858] [2025-03-08 16:50:31,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:50:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:50:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:31,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:50:31,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:31,105 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:50:36,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:37,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:39,575 INFO L93 Difference]: Finished difference Result 188 states and 254 transitions. [2025-03-08 16:50:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:50:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 96 [2025-03-08 16:50:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:39,577 INFO L225 Difference]: With dead ends: 188 [2025-03-08 16:50:39,577 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:50:39,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:50:39,578 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 86 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:39,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 651 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-08 16:50:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:50:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-08 16:50:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 16:50:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-03-08 16:50:39,584 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 96 [2025-03-08 16:50:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-03-08 16:50:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:50:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-03-08 16:50:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:50:39,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:39,587 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:39,594 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 (8)] Ended with exit code 0 [2025-03-08 16:50:39,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-08 16:50:39,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1793972459, now seen corresponding path program 1 times [2025-03-08 16:50:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858730442] [2025-03-08 16:50:39,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:39,789 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-08 16:50:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:39,791 INFO L229 MonitoredProcess]: Starting monitored process 9 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-08 16:50:39,792 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 (9)] Waiting until timeout for monitored process [2025-03-08 16:50:39,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:50:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:50:40,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:40,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:50:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:40,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:50:40,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:50:40,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-08 16:50:40,154 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 41 treesize of output 27 [2025-03-08 16:50:40,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:50:40,304 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 31 treesize of output 15 [2025-03-08 16:50:40,394 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 31 treesize of output 15 [2025-03-08 16:50:40,466 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 31 treesize of output 15 [2025-03-08 16:50:40,534 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 31 treesize of output 15 [2025-03-08 16:50:40,606 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 31 treesize of output 15 [2025-03-08 16:50:40,708 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-08 16:50:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:50:42,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:42,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2025-03-08 16:50:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:50:42,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858730442] [2025-03-08 16:50:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858730442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:50:42,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:50:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-08 16:50:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67371580] [2025-03-08 16:50:42,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:50:42,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:50:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:42,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:50:42,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2025-03-08 16:50:42,980 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 16 states have internal predecessors, (92), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:49,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:50,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:52,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:53,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:56,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:57,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:58,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:50:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:58,664 INFO L93 Difference]: Finished difference Result 276 states and 364 transitions. [2025-03-08 16:50:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:50:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 16 states have internal predecessors, (92), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 96 [2025-03-08 16:50:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:58,666 INFO L225 Difference]: With dead ends: 276 [2025-03-08 16:50:58,666 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:50:58,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=236, Invalid=633, Unknown=1, NotChecked=0, Total=870 [2025-03-08 16:50:58,667 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 146 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:58,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 481 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-03-08 16:50:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:50:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 138. [2025-03-08 16:50:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 115 states have internal predecessors, (143), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:50:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2025-03-08 16:50:58,682 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 96 [2025-03-08 16:50:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:58,682 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2025-03-08 16:50:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 16 states have internal predecessors, (92), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2025-03-08 16:50:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:50:58,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:58,683 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:58,691 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 (9)] Ended with exit code 0 [2025-03-08 16:50:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-08 16:50:58,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1256230356, now seen corresponding path program 1 times [2025-03-08 16:50:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479420746] [2025-03-08 16:50:58,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:58,884 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-08 16:50:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:58,886 INFO L229 MonitoredProcess]: Starting monitored process 10 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-08 16:50:58,887 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 (10)] Waiting until timeout for monitored process [2025-03-08 16:50:58,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:50:59,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:50:59,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:59,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:59,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:50:59,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:59,129 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 21 treesize of output 21 [2025-03-08 16:50:59,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:59,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 16:50:59,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:59,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 20 [2025-03-08 16:50:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:50:59,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:59,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479420746] [2025-03-08 16:50:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479420746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:59,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240169657] [2025-03-08 16:50:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:59,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:59,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:59,221 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:51:01,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:02,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:04,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:06,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:09,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:51:10,123 INFO L93 Difference]: Finished difference Result 277 states and 363 transitions. [2025-03-08 16:51:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:51:10,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-08 16:51:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:51:10,125 INFO L225 Difference]: With dead ends: 277 [2025-03-08 16:51:10,125 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 16:51:10,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:51:10,125 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:51:10,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 343 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2025-03-08 16:51:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 16:51:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2025-03-08 16:51:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 162 states have internal predecessors, (203), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:51:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2025-03-08 16:51:10,144 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 96 [2025-03-08 16:51:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:51:10,144 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2025-03-08 16:51:10,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:51:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2025-03-08 16:51:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:51:10,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:51:10,145 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:51:10,154 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 (10)] Ended with exit code 0 [2025-03-08 16:51:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-08 16:51:10,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:51:10,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:51:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2100702227, now seen corresponding path program 1 times [2025-03-08 16:51:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:51:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387527166] [2025-03-08 16:51:10,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:51:10,346 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-08 16:51:10,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:51:10,348 INFO L229 MonitoredProcess]: Starting monitored process 11 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-08 16:51:10,349 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 (11)] Waiting until timeout for monitored process [2025-03-08 16:51:10,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:51:10,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:51:10,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:51:10,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:51:10,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:51:10,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:51:10,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:51:10,583 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 26 treesize of output 26 [2025-03-08 16:51:10,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 51 [2025-03-08 16:51:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 16:51:10,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:51:10,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:51:10,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387527166] [2025-03-08 16:51:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387527166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:51:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:51:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:51:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355454925] [2025-03-08 16:51:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:51:10,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:51:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:51:10,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:51:10,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:51:10,653 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:51:12,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:14,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:51:15,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []