./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:55:12,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:55:12,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:55:12,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:55:12,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:55:12,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:55:12,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:55:12,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:55:12,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:55:12,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:55:12,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:55:12,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:55:12,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:55:12,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:55:12,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:55:12,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:55:12,843 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-03-17 05:55:13,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:55:13,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:55:13,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:55:13,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:55:13,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:55:13,063 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-25.i [2025-03-17 05:55:14,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde9b31b3/87cd82986ccb498e92528fa26801ebc8/FLAG7fa103249 [2025-03-17 05:55:14,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:55:14,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-03-17 05:55:14,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde9b31b3/87cd82986ccb498e92528fa26801ebc8/FLAG7fa103249 [2025-03-17 05:55:14,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde9b31b3/87cd82986ccb498e92528fa26801ebc8 [2025-03-17 05:55:14,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:55:14,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:55:14,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:55:14,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:55:14,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:55:14,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9de218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14, skipping insertion in model container [2025-03-17 05:55:14,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:55:14,577 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-25.i[916,929] [2025-03-17 05:55:14,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:55:14,622 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:55:14,630 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-25.i[916,929] [2025-03-17 05:55:14,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:55:14,685 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:55:14,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14 WrapperNode [2025-03-17 05:55:14,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:55:14,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:55:14,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:55:14,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:55:14,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,729 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-17 05:55:14,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:55:14,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:55:14,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:55:14,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:55:14,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,744 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:55:14,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:55:14,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:55:14,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:55:14,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:55:14,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (1/1) ... [2025-03-17 05:55:14,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:55:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:14,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:55:14,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:55:14,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:55:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:55:14,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:55:14,901 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:55:14,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:55:15,306 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-03-17 05:55:15,348 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-17 05:55:15,348 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:55:15,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:55:15,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:55:15,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:55:15 BoogieIcfgContainer [2025-03-17 05:55:15,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:55:15,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:55:15,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:55:15,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:55:15,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:55:14" (1/3) ... [2025-03-17 05:55:15,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f154c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:55:15, skipping insertion in model container [2025-03-17 05:55:15,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:55:14" (2/3) ... [2025-03-17 05:55:15,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f154c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:55:15, skipping insertion in model container [2025-03-17 05:55:15,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:55:15" (3/3) ... [2025-03-17 05:55:15,366 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-03-17 05:55:15,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:55:15,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:55:15,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:55:15,429 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;@1980b763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:55:15,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:55:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:55:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:55:15,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:15,445 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:15,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1110243529, now seen corresponding path program 1 times [2025-03-17 05:55:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257306836] [2025-03-17 05:55:15,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:15,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:55:15,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:55:15,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:15,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:55:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257306836] [2025-03-17 05:55:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257306836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:55:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894635843] [2025-03-17 05:55:15,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:15,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:55:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:15,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:55:15,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:55:15,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:55:15,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:55:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:15,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:55:15,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:55:16,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:55:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894635843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:55:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:55:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562701993] [2025-03-17 05:55:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:55:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:55:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:55:16,025 INFO L87 Difference]: Start difference. First operand has 118 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:16,045 INFO L93 Difference]: Finished difference Result 233 states and 368 transitions. [2025-03-17 05:55:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:55:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:55:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:16,051 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:55:16,051 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:55:16,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:55:16,055 INFO L435 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:16,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:55:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:55:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:55:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:55:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-17 05:55:16,090 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 140 [2025-03-17 05:55:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-17 05:55:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-17 05:55:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:55:16,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:16,096 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:16,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:55:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:55:16,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2052398343, now seen corresponding path program 1 times [2025-03-17 05:55:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080229958] [2025-03-17 05:55:16,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:55:16,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:55:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080229958] [2025-03-17 05:55:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080229958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:16,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:55:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666678526] [2025-03-17 05:55:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:16,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:55:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:16,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:55:16,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:55:16,616 INFO L87 Difference]: Start difference. First operand 116 states and 172 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:16,650 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2025-03-17 05:55:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:55:16,650 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:55:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:16,651 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:55:16,651 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:55:16,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:55:16,652 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:16,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:55:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:55:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-17 05:55:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:55:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2025-03-17 05:55:16,665 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 140 [2025-03-17 05:55:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2025-03-17 05:55:16,668 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2025-03-17 05:55:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:55:16,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:16,669 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:55:16,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 270898408, now seen corresponding path program 1 times [2025-03-17 05:55:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679531497] [2025-03-17 05:55:16,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:16,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:55:16,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:55:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679531497] [2025-03-17 05:55:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679531497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:55:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937075166] [2025-03-17 05:55:17,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:55:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:55:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:55:17,850 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:18,264 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2025-03-17 05:55:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:55:18,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:55:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:18,267 INFO L225 Difference]: With dead ends: 312 [2025-03-17 05:55:18,269 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 05:55:18,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-17 05:55:18,270 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 101 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:18,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 473 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:55:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 05:55:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-03-17 05:55:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 161 states have (on average 1.4037267080745341) internal successors, (226), 162 states have internal predecessors, (226), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:55:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 282 transitions. [2025-03-17 05:55:18,292 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 282 transitions. Word has length 140 [2025-03-17 05:55:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 282 transitions. [2025-03-17 05:55:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 282 transitions. [2025-03-17 05:55:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:55:18,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:18,297 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:18,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:55:18,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:18,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash 682437612, now seen corresponding path program 1 times [2025-03-17 05:55:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251526292] [2025-03-17 05:55:18,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:18,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:55:18,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:55:18,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:18,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251526292] [2025-03-17 05:55:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251526292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:19,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:55:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371621063] [2025-03-17 05:55:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:19,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:55:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:19,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:55:19,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:55:19,279 INFO L87 Difference]: Start difference. First operand 192 states and 282 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:19,691 INFO L93 Difference]: Finished difference Result 388 states and 568 transitions. [2025-03-17 05:55:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:55:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:55:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:19,693 INFO L225 Difference]: With dead ends: 388 [2025-03-17 05:55:19,693 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 05:55:19,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:55:19,694 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 95 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:19,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 745 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:55:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 05:55:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-17 05:55:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 163 states have (on average 1.3987730061349692) internal successors, (228), 164 states have internal predecessors, (228), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:55:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2025-03-17 05:55:19,704 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 140 [2025-03-17 05:55:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2025-03-17 05:55:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2025-03-17 05:55:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:55:19,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:19,708 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:19,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:55:19,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1615764373, now seen corresponding path program 1 times [2025-03-17 05:55:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330542193] [2025-03-17 05:55:19,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:55:19,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:55:19,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:19,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330542193] [2025-03-17 05:55:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330542193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:20,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:55:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74563847] [2025-03-17 05:55:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:20,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:55:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:20,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:55:20,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:55:20,344 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:20,808 INFO L93 Difference]: Finished difference Result 427 states and 623 transitions. [2025-03-17 05:55:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:55:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2025-03-17 05:55:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:20,813 INFO L225 Difference]: With dead ends: 427 [2025-03-17 05:55:20,813 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:55:20,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:55:20,815 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 245 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:20,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 486 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:55:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:55:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2025-03-17 05:55:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 187 states have internal predecessors, (256), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:55:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 328 transitions. [2025-03-17 05:55:20,836 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 328 transitions. Word has length 141 [2025-03-17 05:55:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 328 transitions. [2025-03-17 05:55:20,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 328 transitions. [2025-03-17 05:55:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:55:20,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:20,840 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:20,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:55:20,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:20,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash 70135334, now seen corresponding path program 1 times [2025-03-17 05:55:20,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:20,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115549684] [2025-03-17 05:55:20,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:20,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:20,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:55:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:55:20,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:55:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115549684] [2025-03-17 05:55:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115549684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:55:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299884407] [2025-03-17 05:55:21,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:55:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:21,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:55:21,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:55:21,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:55:21,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:55:21,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:21,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:21,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:55:21,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:21,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:55:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299884407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:55:21,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:55:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739119236] [2025-03-17 05:55:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:55:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:21,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:55:21,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:55:21,248 INFO L87 Difference]: Start difference. First operand 226 states and 328 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:55:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:21,280 INFO L93 Difference]: Finished difference Result 457 states and 663 transitions. [2025-03-17 05:55:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:55:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-17 05:55:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:21,282 INFO L225 Difference]: With dead ends: 457 [2025-03-17 05:55:21,282 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 05:55:21,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:55:21,283 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:55:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 05:55:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-17 05:55:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.368421052631579) internal successors, (260), 191 states have internal predecessors, (260), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:55:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-03-17 05:55:21,294 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 142 [2025-03-17 05:55:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:21,295 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-03-17 05:55:21,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:55:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-03-17 05:55:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:55:21,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:21,296 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:21,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:55:21,496 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,SelfDestructingSolverStorable5 [2025-03-17 05:55:21,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:21,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash -832815544, now seen corresponding path program 1 times [2025-03-17 05:55:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888408727] [2025-03-17 05:55:21,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:21,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:55:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:55:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:22,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888408727] [2025-03-17 05:55:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888408727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:22,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:55:22,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900040157] [2025-03-17 05:55:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:22,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:55:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:22,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:55:22,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:55:22,103 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 7 states, 5 states have (on average 11.4) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:22,782 INFO L93 Difference]: Finished difference Result 460 states and 664 transitions. [2025-03-17 05:55:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:55:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-17 05:55:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:22,784 INFO L225 Difference]: With dead ends: 460 [2025-03-17 05:55:22,784 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 05:55:22,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:55:22,786 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 126 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:22,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 715 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:55:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 05:55:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2025-03-17 05:55:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 183 states have (on average 1.360655737704918) internal successors, (249), 184 states have internal predecessors, (249), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:55:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 321 transitions. [2025-03-17 05:55:22,807 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 321 transitions. Word has length 144 [2025-03-17 05:55:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:22,808 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 321 transitions. [2025-03-17 05:55:22,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 321 transitions. [2025-03-17 05:55:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:55:22,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:22,810 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:55:22,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2097225083, now seen corresponding path program 1 times [2025-03-17 05:55:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841647833] [2025-03-17 05:55:22,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:22,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:55:22,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:55:22,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:22,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841647833] [2025-03-17 05:55:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841647833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:55:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215168850] [2025-03-17 05:55:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:23,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:55:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:23,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:55:23,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:55:23,522 INFO L87 Difference]: Start difference. First operand 223 states and 321 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:23,842 INFO L93 Difference]: Finished difference Result 445 states and 639 transitions. [2025-03-17 05:55:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:55:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-17 05:55:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:23,845 INFO L225 Difference]: With dead ends: 445 [2025-03-17 05:55:23,845 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 05:55:23,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-17 05:55:23,847 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 79 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:23,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 488 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:55:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 05:55:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-17 05:55:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.3535911602209945) internal successors, (245), 182 states have internal predecessors, (245), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:55:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 317 transitions. [2025-03-17 05:55:23,863 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 317 transitions. Word has length 144 [2025-03-17 05:55:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 317 transitions. [2025-03-17 05:55:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2025-03-17 05:55:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:55:23,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:23,864 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:23,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:55:23,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:23,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1432679736, now seen corresponding path program 1 times [2025-03-17 05:55:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458779039] [2025-03-17 05:55:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:23,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:55:23,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:55:23,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:55:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458779039] [2025-03-17 05:55:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458779039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:55:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569165910] [2025-03-17 05:55:24,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:55:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:55:24,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:55:24,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:55:24,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:55:24,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:55:24,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:24,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:24,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:55:24,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:55:24,529 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 33 treesize of output 26 [2025-03-17 05:55:24,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:55:24,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 29 [2025-03-17 05:55:24,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:55:24,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2025-03-17 05:55:24,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:55:24,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2025-03-17 05:55:24,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:55:24,661 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 38 treesize of output 14 [2025-03-17 05:55:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:55:24,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:55:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:55:24,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569165910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:55:24,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:55:24,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-03-17 05:55:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711065489] [2025-03-17 05:55:24,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:55:24,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:55:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:24,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:55:24,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:55:24,930 INFO L87 Difference]: Start difference. First operand 221 states and 317 transitions. Second operand has 16 states, 12 states have (on average 9.833333333333334) internal successors, (118), 16 states have internal predecessors, (118), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) [2025-03-17 05:55:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:26,095 INFO L93 Difference]: Finished difference Result 585 states and 828 transitions. [2025-03-17 05:55:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:55:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 9.833333333333334) internal successors, (118), 16 states have internal predecessors, (118), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) Word has length 144 [2025-03-17 05:55:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:26,099 INFO L225 Difference]: With dead ends: 585 [2025-03-17 05:55:26,099 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 05:55:26,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 277 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:55:26,100 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 660 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:26,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 496 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:55:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 05:55:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 349. [2025-03-17 05:55:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 286 states have (on average 1.3426573426573427) internal successors, (384), 288 states have internal predecessors, (384), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:55:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 492 transitions. [2025-03-17 05:55:26,126 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 492 transitions. Word has length 144 [2025-03-17 05:55:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:26,126 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 492 transitions. [2025-03-17 05:55:26,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 9.833333333333334) internal successors, (118), 16 states have internal predecessors, (118), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) [2025-03-17 05:55:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 492 transitions. [2025-03-17 05:55:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:55:26,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:26,127 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:26,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:55:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:55:26,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1929097585, now seen corresponding path program 1 times [2025-03-17 05:55:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-03-17 05:55:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:26,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:55:26,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:55:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-03-17 05:55:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023350698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:55:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489279364] [2025-03-17 05:55:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:26,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:55:26,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:26,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:55:26,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:55:26,714 INFO L87 Difference]: Start difference. First operand 349 states and 492 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:55:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:27,243 INFO L93 Difference]: Finished difference Result 817 states and 1152 transitions. [2025-03-17 05:55:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:55:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:55:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:27,247 INFO L225 Difference]: With dead ends: 817 [2025-03-17 05:55:27,247 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 05:55:27,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:55:27,248 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 85 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:27,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 595 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:55:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 05:55:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2025-03-17 05:55:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 396 states have (on average 1.3636363636363635) internal successors, (540), 400 states have internal predecessors, (540), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:55:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 656 transitions. [2025-03-17 05:55:27,283 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 656 transitions. Word has length 145 [2025-03-17 05:55:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:27,283 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 656 transitions. [2025-03-17 05:55:27,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:55:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 656 transitions. [2025-03-17 05:55:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:27,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:27,288 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:55:27,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1323830829, now seen corresponding path program 1 times [2025-03-17 05:55:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062160816] [2025-03-17 05:55:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:27,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:27,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062160816] [2025-03-17 05:55:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062160816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:55:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611524361] [2025-03-17 05:55:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:29,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:55:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:29,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:55:29,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:55:29,139 INFO L87 Difference]: Start difference. First operand 465 states and 656 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:31,450 INFO L93 Difference]: Finished difference Result 1187 states and 1671 transitions. [2025-03-17 05:55:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:55:31,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-17 05:55:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:31,455 INFO L225 Difference]: With dead ends: 1187 [2025-03-17 05:55:31,455 INFO L226 Difference]: Without dead ends: 723 [2025-03-17 05:55:31,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:55:31,456 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 172 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:31,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1662 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 05:55:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-17 05:55:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 537. [2025-03-17 05:55:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 468 states have (on average 1.3846153846153846) internal successors, (648), 472 states have internal predecessors, (648), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:55:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 764 transitions. [2025-03-17 05:55:31,485 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 764 transitions. Word has length 147 [2025-03-17 05:55:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:31,486 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 764 transitions. [2025-03-17 05:55:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 764 transitions. [2025-03-17 05:55:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:31,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:31,488 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:31,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:55:31,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1617233836, now seen corresponding path program 1 times [2025-03-17 05:55:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334244878] [2025-03-17 05:55:31,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:31,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:31,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:31,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:31,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334244878] [2025-03-17 05:55:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334244878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:32,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:32,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:55:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528788457] [2025-03-17 05:55:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:32,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:55:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:32,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:55:32,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:55:32,672 INFO L87 Difference]: Start difference. First operand 537 states and 764 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:47,019 WARN L286 SmtUtils]: Spent 12.27s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:55:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:47,983 INFO L93 Difference]: Finished difference Result 1159 states and 1644 transitions. [2025-03-17 05:55:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:55:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 05:55:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:47,988 INFO L225 Difference]: With dead ends: 1159 [2025-03-17 05:55:47,988 INFO L226 Difference]: Without dead ends: 623 [2025-03-17 05:55:47,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:55:47,990 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 89 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:47,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 922 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 05:55:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-17 05:55:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 537. [2025-03-17 05:55:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 468 states have (on average 1.376068376068376) internal successors, (644), 472 states have internal predecessors, (644), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:55:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 760 transitions. [2025-03-17 05:55:48,019 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 760 transitions. Word has length 147 [2025-03-17 05:55:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 760 transitions. [2025-03-17 05:55:48,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 760 transitions. [2025-03-17 05:55:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:48,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:48,021 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:48,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:55:48,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:48,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2117363415, now seen corresponding path program 1 times [2025-03-17 05:55:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:48,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486416965] [2025-03-17 05:55:48,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486416965] [2025-03-17 05:55:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486416965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:49,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:55:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975376398] [2025-03-17 05:55:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:49,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:55:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:49,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:55:49,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:55:49,524 INFO L87 Difference]: Start difference. First operand 537 states and 760 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:51,468 INFO L93 Difference]: Finished difference Result 1159 states and 1636 transitions. [2025-03-17 05:55:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:55:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-17 05:55:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:51,472 INFO L225 Difference]: With dead ends: 1159 [2025-03-17 05:55:51,472 INFO L226 Difference]: Without dead ends: 623 [2025-03-17 05:55:51,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:55:51,474 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 164 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:51,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1812 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:55:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-17 05:55:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 505. [2025-03-17 05:55:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 436 states have (on average 1.371559633027523) internal successors, (598), 440 states have internal predecessors, (598), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:55:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 714 transitions. [2025-03-17 05:55:51,498 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 714 transitions. Word has length 147 [2025-03-17 05:55:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:51,499 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 714 transitions. [2025-03-17 05:55:51,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:55:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 714 transitions. [2025-03-17 05:55:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:51,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:51,500 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:55:51,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:51,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -362216812, now seen corresponding path program 1 times [2025-03-17 05:55:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033412275] [2025-03-17 05:55:51,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:51,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:51,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033412275] [2025-03-17 05:55:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033412275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:52,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:55:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595808979] [2025-03-17 05:55:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:52,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:55:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:52,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:55:52,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:55:52,565 INFO L87 Difference]: Start difference. First operand 505 states and 714 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:53,616 INFO L93 Difference]: Finished difference Result 1021 states and 1436 transitions. [2025-03-17 05:55:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:55:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 05:55:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:53,620 INFO L225 Difference]: With dead ends: 1021 [2025-03-17 05:55:53,621 INFO L226 Difference]: Without dead ends: 517 [2025-03-17 05:55:53,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:55:53,623 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 88 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:53,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 813 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:55:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-17 05:55:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 431. [2025-03-17 05:55:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 366 states have (on average 1.355191256830601) internal successors, (496), 368 states have internal predecessors, (496), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:55:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 604 transitions. [2025-03-17 05:55:53,660 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 604 transitions. Word has length 147 [2025-03-17 05:55:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:53,660 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 604 transitions. [2025-03-17 05:55:53,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:55:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 604 transitions. [2025-03-17 05:55:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:53,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:53,663 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:53,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:55:53,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -655619819, now seen corresponding path program 1 times [2025-03-17 05:55:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068658918] [2025-03-17 05:55:53,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:53,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:53,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:53,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:53,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:55:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:55:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:55:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068658918] [2025-03-17 05:55:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068658918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:55:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:55:55,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:55:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106294668] [2025-03-17 05:55:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:55:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:55:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:55:55,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:55:55,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:55:55,261 INFO L87 Difference]: Start difference. First operand 431 states and 604 transitions. Second operand has 15 states, 12 states have (on average 5.0) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:55:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:55:56,812 INFO L93 Difference]: Finished difference Result 969 states and 1348 transitions. [2025-03-17 05:55:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:55:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 5.0) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-17 05:55:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:55:56,815 INFO L225 Difference]: With dead ends: 969 [2025-03-17 05:55:56,815 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 05:55:56,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:55:56,816 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 77 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:55:56,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1753 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:55:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 05:55:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 523. [2025-03-17 05:55:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 446 states have (on average 1.3542600896860986) internal successors, (604), 450 states have internal predecessors, (604), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:55:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 728 transitions. [2025-03-17 05:55:56,849 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 728 transitions. Word has length 147 [2025-03-17 05:55:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:55:56,850 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 728 transitions. [2025-03-17 05:55:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 5.0) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:55:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 728 transitions. [2025-03-17 05:55:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:55:56,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:55:56,851 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:56,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:55:56,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:55:56,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:55:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -806386520, now seen corresponding path program 1 times [2025-03-17 05:55:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:55:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796297778] [2025-03-17 05:55:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:55:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:55:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:56,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:56,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:56,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:55:56,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:55:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:55:56,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:55:56,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:55:56,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:55:56,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:55:56,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:55:56,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:55:56,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:55:56,972 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:55:57,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:55:57,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:55:57 BoogieIcfgContainer [2025-03-17 05:55:57,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:55:57,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:55:57,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:55:57,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:55:57,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:55:15" (3/4) ... [2025-03-17 05:55:57,058 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:55:57,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:55:57,062 INFO L158 Benchmark]: Toolchain (without parser) took 42595.72ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 105.6MB in the beginning and 1.0GB in the end (delta: -931.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-03-17 05:55:57,062 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:55:57,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 88.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:55:57,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:55:57,062 INFO L158 Benchmark]: Boogie Preprocessor took 35.11ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:55:57,063 INFO L158 Benchmark]: IcfgBuilder took 592.23ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.5MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:55:57,063 INFO L158 Benchmark]: TraceAbstraction took 41694.19ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 45.4MB in the beginning and 1.0GB in the end (delta: -992.2MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. [2025-03-17 05:55:57,063 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 350.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:55:57,064 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.47ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 88.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.11ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 592.23ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.5MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41694.19ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 45.4MB in the beginning and 1.0GB in the end (delta: -992.2MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 350.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L58] EXPR WrapperStruct00.var_1_9 [L58] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) [L65] EXPR WrapperStruct00.var_1_14 [L65] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_14 [L67] EXPR WrapperStruct00.var_1_3 [L67] unsigned short int stepLocal_0 = WrapperStruct00.var_1_3; [L68] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=15] [L68] COND TRUE WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=15] [L69] COND FALSE !(stepLocal_0 <= WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned long int stepLocal_1 = WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=256] [L76] COND FALSE !(WrapperStruct00.var_1_7 >= stepLocal_1) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L81] EXPR WrapperStruct00.var_1_10 [L81] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) [L81] EXPR WrapperStruct00.var_1_8 [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] COND TRUE WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8))) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_10 [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_9 [L122] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122-L123] return (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 194 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.6s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1997 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1981 mSDsluCounter, 12297 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9808 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10652 IncrementalHoareTripleChecker+Invalid, 11060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 2489 mSDtfsCounter, 10652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 691 SyntacticMatches, 9 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=11, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 538 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2728 NumberOfCodeBlocks, 2728 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2706 ConstructedInterpolants, 0 QuantifiedInterpolants, 14286 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 11534/11628 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:55:57,123 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-25.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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:55:58,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:55:58,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:55:58,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:55:58,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:55:58,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:55:58,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:55:58,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:55:58,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:55:58,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:55:58,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:55:58,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:55:58,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:55:58,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:55:58,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:55:58,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:55:58,989 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-03-17 05:55:59,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:55:59,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:55:59,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:55:59,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:55:59,232 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:55:59,234 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-25.i [2025-03-17 05:56:00,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2785849f0/6583aea35f984650bee95d1c1298c523/FLAGc93bdc805 [2025-03-17 05:56:00,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:56:00,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-03-17 05:56:00,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2785849f0/6583aea35f984650bee95d1c1298c523/FLAGc93bdc805 [2025-03-17 05:56:00,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2785849f0/6583aea35f984650bee95d1c1298c523 [2025-03-17 05:56:00,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:56:00,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:56:00,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:56:00,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:56:00,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:56:00,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5357c03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00, skipping insertion in model container [2025-03-17 05:56:00,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:56:00,768 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-25.i[916,929] [2025-03-17 05:56:00,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:56:00,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:56:00,846 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-25.i[916,929] [2025-03-17 05:56:00,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:56:00,916 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:56:00,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00 WrapperNode [2025-03-17 05:56:00,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:56:00,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:56:00,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:56:00,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:56:00,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,971 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-03-17 05:56:00,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:56:00,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:56:00,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:56:00,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:56:00,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:00,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,020 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-17 05:56:01,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:56:01,063 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:56:01,063 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:56:01,063 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:56:01,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (1/1) ... [2025-03-17 05:56:01,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:56:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:56:01,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:56:01,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:56:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:56:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:56:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:56:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:56:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:56:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:56:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:56:01,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:56:01,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:56:01,784 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-03-17 05:56:01,812 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-03-17 05:56:01,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:56:01,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:56:01,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:56:01,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:56:01 BoogieIcfgContainer [2025-03-17 05:56:01,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:56:01,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:56:01,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:56:01,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:56:01,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:56:00" (1/3) ... [2025-03-17 05:56:01,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445cc985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:56:01, skipping insertion in model container [2025-03-17 05:56:01,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:56:00" (2/3) ... [2025-03-17 05:56:01,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445cc985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:56:01, skipping insertion in model container [2025-03-17 05:56:01,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:56:01" (3/3) ... [2025-03-17 05:56:01,827 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-03-17 05:56:01,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:56:01,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:56:01,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:56:01,890 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;@4b4455c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:56:01,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:56:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:56:01,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:01,908 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:01,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:01,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash -145994596, now seen corresponding path program 1 times [2025-03-17 05:56:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360675822] [2025-03-17 05:56:01,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:01,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:56:01,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:56:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:56:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:56:02,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:02,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:56:02,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-17 05:56:02,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:02,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360675822] [2025-03-17 05:56:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360675822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:56:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645557676] [2025-03-17 05:56:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:02,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:56:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:02,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:56:02,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:56:02,305 INFO L87 Difference]: Start difference. First operand has 118 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:56:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:02,346 INFO L93 Difference]: Finished difference Result 233 states and 368 transitions. [2025-03-17 05:56:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:56:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:56:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:02,351 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:56:02,352 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:56:02,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:56:02,355 INFO L435 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:02,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:56:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:56:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:56:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-17 05:56:02,387 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 140 [2025-03-17 05:56:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:02,387 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-17 05:56:02,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:56:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-17 05:56:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:56:02,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:02,393 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:02,408 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-17 05:56:02,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:02,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1278320020, now seen corresponding path program 1 times [2025-03-17 05:56:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:02,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273023895] [2025-03-17 05:56:02,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:02,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:02,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:02,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:56:02,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:56:02,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:56:02,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:56:02,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:02,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:02,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:56:02,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:03,086 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 44 treesize of output 31 [2025-03-17 05:56:03,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:03,130 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 50 treesize of output 20 [2025-03-17 05:56:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:56:03,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:03,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273023895] [2025-03-17 05:56:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273023895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:03,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:56:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651548502] [2025-03-17 05:56:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:03,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:56:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:03,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:56:03,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:56:03,188 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:05,165 INFO L93 Difference]: Finished difference Result 349 states and 509 transitions. [2025-03-17 05:56:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:56:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2025-03-17 05:56:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:05,168 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:56:05,168 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:56:05,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:56:05,170 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 372 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:05,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 429 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:56:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:56:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 126. [2025-03-17 05:56:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2025-03-17 05:56:05,193 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 140 [2025-03-17 05:56:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:05,197 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2025-03-17 05:56:05,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2025-03-17 05:56:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:56:05,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:05,200 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:05,210 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-17 05:56:05,401 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-17 05:56:05,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:05,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1373359133, now seen corresponding path program 1 times [2025-03-17 05:56:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161164808] [2025-03-17 05:56:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:05,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:05,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:05,404 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-17 05:56:05,406 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-17 05:56:05,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:56:05,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:56:05,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:05,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:05,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:56:05,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:05,948 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 44 treesize of output 31 [2025-03-17 05:56:06,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:06,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2025-03-17 05:56:06,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:06,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2025-03-17 05:56:06,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:06,124 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 50 treesize of output 20 [2025-03-17 05:56:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:56:06,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:06,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161164808] [2025-03-17 05:56:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161164808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:06,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:06,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:56:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384944685] [2025-03-17 05:56:06,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:56:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:06,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:56:06,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:56:06,153 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:08,190 INFO L93 Difference]: Finished difference Result 359 states and 516 transitions. [2025-03-17 05:56:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:56:08,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-03-17 05:56:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:08,193 INFO L225 Difference]: With dead ends: 359 [2025-03-17 05:56:08,193 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:56:08,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:56:08,194 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 555 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:08,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 425 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:56:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:56:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 145. [2025-03-17 05:56:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2025-03-17 05:56:08,214 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 141 [2025-03-17 05:56:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2025-03-17 05:56:08,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2025-03-17 05:56:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:56:08,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:08,217 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:08,227 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 (4)] Ended with exit code 0 [2025-03-17 05:56:08,418 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-17 05:56:08,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1674213737, now seen corresponding path program 1 times [2025-03-17 05:56:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976976961] [2025-03-17 05:56:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:08,422 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-17 05:56:08,423 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-17 05:56:08,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:56:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:56:08,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:08,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:08,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:56:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:56:08,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:08,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976976961] [2025-03-17 05:56:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976976961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:56:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710108799] [2025-03-17 05:56:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:56:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:08,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:56:08,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:56:08,673 INFO L87 Difference]: Start difference. First operand 145 states and 209 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:08,704 INFO L93 Difference]: Finished difference Result 292 states and 421 transitions. [2025-03-17 05:56:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:56:08,705 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:56:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:08,706 INFO L225 Difference]: With dead ends: 292 [2025-03-17 05:56:08,706 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 05:56:08,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:56:08,707 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:08,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:56:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 05:56:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-17 05:56:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. [2025-03-17 05:56:08,721 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 212 transitions. Word has length 143 [2025-03-17 05:56:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:08,721 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 212 transitions. [2025-03-17 05:56:08,721 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 212 transitions. [2025-03-17 05:56:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:56:08,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:08,722 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:08,733 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-17 05:56:08,925 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-17 05:56:08,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:08,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 769427760, now seen corresponding path program 1 times [2025-03-17 05:56:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152987114] [2025-03-17 05:56:08,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:08,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:08,930 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-17 05:56:08,931 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-17 05:56:09,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:56:09,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:56:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:09,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:09,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:56:09,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:56:09,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:09,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152987114] [2025-03-17 05:56:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152987114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:56:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917818177] [2025-03-17 05:56:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:56:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:09,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:56:09,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:56:09,214 INFO L87 Difference]: Start difference. First operand 148 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:09,538 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2025-03-17 05:56:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:56:09,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 05:56:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:09,539 INFO L225 Difference]: With dead ends: 298 [2025-03-17 05:56:09,539 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 05:56:09,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:56:09,540 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:09,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:56:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 05:56:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-03-17 05:56:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:56:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2025-03-17 05:56:09,556 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 144 [2025-03-17 05:56:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:09,556 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2025-03-17 05:56:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2025-03-17 05:56:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:56:09,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:09,558 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:09,567 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-17 05:56:09,758 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-17 05:56:09,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:09,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1307781583, now seen corresponding path program 1 times [2025-03-17 05:56:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538836158] [2025-03-17 05:56:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:09,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:09,761 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-17 05:56:09,762 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-17 05:56:09,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:56:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:56:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:09,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:56:09,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:10,042 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 25 [2025-03-17 05:56:10,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:10,067 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 32 treesize of output 14 [2025-03-17 05:56:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:56:10,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:10,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538836158] [2025-03-17 05:56:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538836158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:10,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:10,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:56:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406680245] [2025-03-17 05:56:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:10,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:56:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:56:10,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:56:10,080 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:11,414 INFO L93 Difference]: Finished difference Result 405 states and 583 transitions. [2025-03-17 05:56:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:56:11,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 05:56:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:11,416 INFO L225 Difference]: With dead ends: 405 [2025-03-17 05:56:11,416 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 05:56:11,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:56:11,417 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 135 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:11,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 833 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 05:56:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 05:56:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-03-17 05:56:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 216 states have (on average 1.3981481481481481) internal successors, (302), 217 states have internal predecessors, (302), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:56:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 366 transitions. [2025-03-17 05:56:11,429 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 366 transitions. Word has length 144 [2025-03-17 05:56:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:11,429 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 366 transitions. [2025-03-17 05:56:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 366 transitions. [2025-03-17 05:56:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:56:11,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:11,431 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:11,439 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-17 05:56:11,631 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-17 05:56:11,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1731041777, now seen corresponding path program 1 times [2025-03-17 05:56:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230359797] [2025-03-17 05:56:11,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:11,634 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-17 05:56:11,635 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-17 05:56:11,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:56:11,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:56:11,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:11,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:11,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:56:11,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:12,034 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 37 treesize of output 30 [2025-03-17 05:56:12,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:12,073 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 43 treesize of output 19 [2025-03-17 05:56:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:56:12,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:12,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230359797] [2025-03-17 05:56:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230359797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:56:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295745523] [2025-03-17 05:56:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:56:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:12,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:56:12,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:56:12,102 INFO L87 Difference]: Start difference. First operand 253 states and 366 transitions. Second operand has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:13,633 INFO L93 Difference]: Finished difference Result 509 states and 735 transitions. [2025-03-17 05:56:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:56:13,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-17 05:56:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:13,636 INFO L225 Difference]: With dead ends: 509 [2025-03-17 05:56:13,636 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 05:56:13,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:56:13,638 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 129 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:13,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 432 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:56:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 05:56:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2025-03-17 05:56:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:56:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 365 transitions. [2025-03-17 05:56:13,654 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 365 transitions. Word has length 144 [2025-03-17 05:56:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 365 transitions. [2025-03-17 05:56:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 365 transitions. [2025-03-17 05:56:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:56:13,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:13,656 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:13,666 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-17 05:56:13,856 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-17 05:56:13,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 460050680, now seen corresponding path program 1 times [2025-03-17 05:56:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120435426] [2025-03-17 05:56:13,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:13,859 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-17 05:56:13,860 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-17 05:56:13,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:56:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:56:14,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:56:14,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:14,189 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-17 05:56:14,216 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-17 05:56:14,287 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 37 treesize of output 30 [2025-03-17 05:56:14,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:14,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 05:56:14,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:14,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 05:56:14,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:14,428 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 43 treesize of output 19 [2025-03-17 05:56:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 167 proven. 6 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-17 05:56:14,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:56:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:56:14,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120435426] [2025-03-17 05:56:14,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120435426] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:56:14,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:56:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-03-17 05:56:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735627775] [2025-03-17 05:56:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:56:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:14,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:56:14,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:56:14,622 INFO L87 Difference]: Start difference. First operand 253 states and 365 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:16,450 INFO L93 Difference]: Finished difference Result 636 states and 914 transitions. [2025-03-17 05:56:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:56:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:56:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:16,452 INFO L225 Difference]: With dead ends: 636 [2025-03-17 05:56:16,452 INFO L226 Difference]: Without dead ends: 384 [2025-03-17 05:56:16,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:56:16,453 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 184 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:16,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 680 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:56:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-17 05:56:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 254. [2025-03-17 05:56:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 217 states have (on average 1.3870967741935485) internal successors, (301), 218 states have internal predecessors, (301), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:56:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 365 transitions. [2025-03-17 05:56:16,474 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 365 transitions. Word has length 145 [2025-03-17 05:56:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:16,474 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 365 transitions. [2025-03-17 05:56:16,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 365 transitions. [2025-03-17 05:56:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:56:16,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:16,476 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:16,485 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-17 05:56:16,676 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-17 05:56:16,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:16,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 174294328, now seen corresponding path program 1 times [2025-03-17 05:56:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:16,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642267345] [2025-03-17 05:56:16,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:16,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:16,679 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-17 05:56:16,680 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-17 05:56:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:56:16,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:56:16,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:16,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:16,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:56:16,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:17,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 37 treesize of output 30 [2025-03-17 05:56:17,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:17,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 05:56:17,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:17,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 05:56:17,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:17,238 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 43 treesize of output 19 [2025-03-17 05:56:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:56:17,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:17,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:17,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642267345] [2025-03-17 05:56:17,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642267345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:17,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:17,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:56:17,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382059923] [2025-03-17 05:56:17,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:17,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:56:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:17,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:56:17,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:56:17,254 INFO L87 Difference]: Start difference. First operand 254 states and 365 transitions. Second operand has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:18,868 INFO L93 Difference]: Finished difference Result 511 states and 733 transitions. [2025-03-17 05:56:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:56:18,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-17 05:56:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:18,871 INFO L225 Difference]: With dead ends: 511 [2025-03-17 05:56:18,871 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 05:56:18,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:56:18,872 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 118 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:18,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 385 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 05:56:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 05:56:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2025-03-17 05:56:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 196 states have internal predecessors, (268), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:56:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2025-03-17 05:56:18,883 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 145 [2025-03-17 05:56:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:18,883 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2025-03-17 05:56:18,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2025-03-17 05:56:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:56:18,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:18,884 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:18,893 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-17 05:56:19,084 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-17 05:56:19,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2115027207, now seen corresponding path program 1 times [2025-03-17 05:56:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:19,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199548746] [2025-03-17 05:56:19,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:19,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:19,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:19,088 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-17 05:56:19,088 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-17 05:56:19,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:56:19,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:56:19,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:19,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:56:19,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:19,483 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 19 treesize of output 1 [2025-03-17 05:56:19,695 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 80 treesize of output 34 [2025-03-17 05:56:19,766 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 80 treesize of output 34 [2025-03-17 05:56:19,849 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 75 treesize of output 44 [2025-03-17 05:56:20,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:20,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2025-03-17 05:56:20,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:20,110 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 98 treesize of output 38 [2025-03-17 05:56:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 05:56:20,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:20,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199548746] [2025-03-17 05:56:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199548746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:56:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102202041] [2025-03-17 05:56:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:56:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:56:20,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:56:20,152 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:22,554 INFO L93 Difference]: Finished difference Result 696 states and 990 transitions. [2025-03-17 05:56:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:56:22,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-17 05:56:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:22,557 INFO L225 Difference]: With dead ends: 696 [2025-03-17 05:56:22,557 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 05:56:22,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:56:22,558 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 341 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:22,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 404 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 05:56:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 05:56:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 461. [2025-03-17 05:56:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 386 states have (on average 1.3626943005181347) internal successors, (526), 390 states have internal predecessors, (526), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:56:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 654 transitions. [2025-03-17 05:56:22,586 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 654 transitions. Word has length 145 [2025-03-17 05:56:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:22,587 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 654 transitions. [2025-03-17 05:56:22,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 654 transitions. [2025-03-17 05:56:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:56:22,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:22,588 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:22,597 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 (11)] Ended with exit code 0 [2025-03-17 05:56:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:22,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash -870262726, now seen corresponding path program 1 times [2025-03-17 05:56:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508614694] [2025-03-17 05:56:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:22,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:22,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:22,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:56:22,793 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 (12)] Waiting until timeout for monitored process [2025-03-17 05:56:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:56:23,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:56:23,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:23,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:23,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 05:56:23,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:23,133 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 19 treesize of output 1 [2025-03-17 05:56:23,141 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 19 treesize of output 1 [2025-03-17 05:56:23,144 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 19 treesize of output 1 [2025-03-17 05:56:23,146 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 19 treesize of output 1 [2025-03-17 05:56:23,149 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 19 treesize of output 1 [2025-03-17 05:56:23,151 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 19 treesize of output 1 [2025-03-17 05:56:23,153 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 19 treesize of output 1 [2025-03-17 05:56:23,155 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 14 treesize of output 10 [2025-03-17 05:56:23,196 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 25 treesize of output 24 [2025-03-17 05:56:23,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 05:56:23,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:23,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 53 [2025-03-17 05:56:23,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:23,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 53 [2025-03-17 05:56:23,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:23,473 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 61 treesize of output 25 [2025-03-17 05:56:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-17 05:56:23,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:56:23,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508614694] [2025-03-17 05:56:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508614694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:56:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:56:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:56:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441822276] [2025-03-17 05:56:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:23,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:56:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:23,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:56:23,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:56:23,501 INFO L87 Difference]: Start difference. First operand 461 states and 654 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:25,170 INFO L93 Difference]: Finished difference Result 1159 states and 1642 transitions. [2025-03-17 05:56:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:56:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-17 05:56:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:25,173 INFO L225 Difference]: With dead ends: 1159 [2025-03-17 05:56:25,173 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 05:56:25,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:56:25,175 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 209 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:25,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 343 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 05:56:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 05:56:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 693. [2025-03-17 05:56:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 606 states have (on average 1.3795379537953796) internal successors, (836), 614 states have internal predecessors, (836), 72 states have call successors, (72), 14 states have call predecessors, (72), 14 states have return successors, (72), 64 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:56:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 980 transitions. [2025-03-17 05:56:25,225 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 980 transitions. Word has length 145 [2025-03-17 05:56:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:25,226 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 980 transitions. [2025-03-17 05:56:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:56:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 980 transitions. [2025-03-17 05:56:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:56:25,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:25,227 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:25,237 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 (12)] Ended with exit code 0 [2025-03-17 05:56:25,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:25,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -254212068, now seen corresponding path program 1 times [2025-03-17 05:56:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122881743] [2025-03-17 05:56:25,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:25,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:56:25,432 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 (13)] Waiting until timeout for monitored process [2025-03-17 05:56:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:56:25,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:56:25,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:25,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:25,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:56:25,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:25,771 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-17 05:56:25,798 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-17 05:56:25,823 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-17 05:56:25,844 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-17 05:56:25,859 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-17 05:56:25,873 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 24 treesize of output 23 [2025-03-17 05:56:25,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 05:56:25,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:25,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 05:56:26,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:26,070 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 68 treesize of output 26 [2025-03-17 05:56:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 407 proven. 30 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-17 05:56:26,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:56:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:56:26,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122881743] [2025-03-17 05:56:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122881743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:56:26,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:56:26,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 05:56:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390149285] [2025-03-17 05:56:26,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:56:26,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:56:26,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:26,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:56:26,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:56:26,672 INFO L87 Difference]: Start difference. First operand 693 states and 980 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 4 states have call predecessors, (29), 6 states have call successors, (29) [2025-03-17 05:56:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:29,142 INFO L93 Difference]: Finished difference Result 1460 states and 2027 transitions. [2025-03-17 05:56:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:56:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 4 states have call predecessors, (29), 6 states have call successors, (29) Word has length 147 [2025-03-17 05:56:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:29,147 INFO L225 Difference]: With dead ends: 1460 [2025-03-17 05:56:29,148 INFO L226 Difference]: Without dead ends: 768 [2025-03-17 05:56:29,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:56:29,149 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 430 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:29,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 417 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 05:56:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-17 05:56:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 526. [2025-03-17 05:56:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 461 states have (on average 1.3644251626898047) internal successors, (629), 466 states have internal predecessors, (629), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:56:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 725 transitions. [2025-03-17 05:56:29,188 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 725 transitions. Word has length 147 [2025-03-17 05:56:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:29,188 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 725 transitions. [2025-03-17 05:56:29,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 17 states have internal predecessors, (95), 6 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 4 states have call predecessors, (29), 6 states have call successors, (29) [2025-03-17 05:56:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 725 transitions. [2025-03-17 05:56:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:56:29,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:29,190 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:29,200 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 (13)] Ended with exit code 0 [2025-03-17 05:56:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:29,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:56:29,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:56:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 707401949, now seen corresponding path program 1 times [2025-03-17 05:56:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:56:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176306351] [2025-03-17 05:56:29,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:56:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:56:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:56:29,393 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:56:29,394 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 (14)] Waiting until timeout for monitored process [2025-03-17 05:56:29,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:56:29,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:56:29,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:56:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:56:29,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 05:56:29,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:56:29,752 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 14 treesize of output 10 [2025-03-17 05:56:29,788 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 25 treesize of output 24 [2025-03-17 05:56:29,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:29,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 05:56:29,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:29,971 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 49 treesize of output 39 [2025-03-17 05:56:30,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,054 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 49 treesize of output 39 [2025-03-17 05:56:30,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,132 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 49 treesize of output 39 [2025-03-17 05:56:30,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,191 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 49 treesize of output 39 [2025-03-17 05:56:30,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,265 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 44 treesize of output 49 [2025-03-17 05:56:30,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 62 [2025-03-17 05:56:30,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 65 [2025-03-17 05:56:30,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 75 [2025-03-17 05:56:30,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:30,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 75 [2025-03-17 05:56:31,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:31,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 75 [2025-03-17 05:56:31,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:56:31,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 107 treesize of output 41 [2025-03-17 05:56:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 491 proven. 30 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:56:31,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:56:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:56:31,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:56:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176306351] [2025-03-17 05:56:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176306351] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:56:31,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:56:31,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-03-17 05:56:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070532029] [2025-03-17 05:56:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:56:31,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:56:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:56:31,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:56:31,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:56:31,373 INFO L87 Difference]: Start difference. First operand 526 states and 725 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:56:31,941 INFO L93 Difference]: Finished difference Result 1068 states and 1462 transitions. [2025-03-17 05:56:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:56:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-17 05:56:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:56:31,944 INFO L225 Difference]: With dead ends: 1068 [2025-03-17 05:56:31,944 INFO L226 Difference]: Without dead ends: 543 [2025-03-17 05:56:31,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:56:31,946 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 142 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:56:31,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 394 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:56:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-17 05:56:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 415. [2025-03-17 05:56:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 356 states have (on average 1.3370786516853932) internal successors, (476), 358 states have internal predecessors, (476), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:56:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 560 transitions. [2025-03-17 05:56:31,975 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 560 transitions. Word has length 147 [2025-03-17 05:56:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:56:31,975 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 560 transitions. [2025-03-17 05:56:31,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:56:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 560 transitions. [2025-03-17 05:56:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:56:31,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:56:31,976 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:56:31,987 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 (14)] Ended with exit code 0