./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:50:17,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:50:17,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:50:17,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:50:17,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:50:17,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:50:17,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:50:17,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:50:17,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:50:17,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:50:17,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:50:17,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:50:17,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:50:17,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:17,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:50:17,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:50:17,847 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2025-03-08 16:50:18,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:50:18,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:50:18,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:50:18,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:50:18,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:50:18,088 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-37.i [2025-03-08 16:50:19,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babe057d2/9d5dec9509a847448986071ad369ed64/FLAG8cdaf7cb4 [2025-03-08 16:50:19,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:50:19,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2025-03-08 16:50:19,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babe057d2/9d5dec9509a847448986071ad369ed64/FLAG8cdaf7cb4 [2025-03-08 16:50:19,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babe057d2/9d5dec9509a847448986071ad369ed64 [2025-03-08 16:50:19,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:50:19,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:50:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:50:19,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:50:19,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380742bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19, skipping insertion in model container [2025-03-08 16:50:19,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:50:19,631 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-37.i[916,929] [2025-03-08 16:50:19,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:19,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:50:19,703 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-37.i[916,929] [2025-03-08 16:50:19,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:19,747 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:50:19,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19 WrapperNode [2025-03-08 16:50:19,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:19,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:19,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:50:19,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:50:19,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,786 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-03-08 16:50:19,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:19,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:50:19,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:50:19,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:50:19,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,811 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:50:19,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:50:19,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:50:19,830 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:50:19,830 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:50:19,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (1/1) ... [2025-03-08 16:50:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:19,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:50:19,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:50:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:50:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:50:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:50:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:50:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:50:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:50:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:50:19,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:50:19,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:50:20,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-08 16:50:20,390 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-08 16:50:20,390 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:50:20,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:50:20,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:50:20,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:20 BoogieIcfgContainer [2025-03-08 16:50:20,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:50:20,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:50:20,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:50:20,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:50:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:50:19" (1/3) ... [2025-03-08 16:50:20,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457477e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:20, skipping insertion in model container [2025-03-08 16:50:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:19" (2/3) ... [2025-03-08 16:50:20,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457477e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:20, skipping insertion in model container [2025-03-08 16:50:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:20" (3/3) ... [2025-03-08 16:50:20,412 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2025-03-08 16:50:20,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:50:20,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:50:20,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:50:20,477 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;@6cd7bb57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:50:20,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:50:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:50:20,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:20,490 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:20,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 772012318, now seen corresponding path program 1 times [2025-03-08 16:50:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147187873] [2025-03-08 16:50:20,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:20,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:20,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:20,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:20,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:50:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:20,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147187873] [2025-03-08 16:50:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147187873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:20,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547409570] [2025-03-08 16:50:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:20,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:20,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:20,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:50:20,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:50:21,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:50:21,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547409570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:50:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:50:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683258328] [2025-03-08 16:50:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:50:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:50:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:50:21,083 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:21,103 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-03-08 16:50:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:50:21,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-08 16:50:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:21,110 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:50:21,111 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 16:50:21,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:50:21,119 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:21,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 16:50:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 16:50:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-08 16:50:21,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-03-08 16:50:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-08 16:50:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-08 16:50:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:50:21,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:21,152 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:21,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:50:21,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:50:21,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1635328569, now seen corresponding path program 1 times [2025-03-08 16:50:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816878151] [2025-03-08 16:50:21,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:21,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:21,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:21,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816878151] [2025-03-08 16:50:21,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816878151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:21,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:21,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:21,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491615329] [2025-03-08 16:50:21,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:21,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:21,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:21,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:21,672 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:21,719 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2025-03-08 16:50:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:50:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:21,724 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:50:21,725 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:50:21,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:21,726 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:21,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:50:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-08 16:50:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-03-08 16:50:21,737 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-03-08 16:50:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-03-08 16:50:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-03-08 16:50:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:50:21,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:21,739 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:21,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:50:21,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 852184264, now seen corresponding path program 1 times [2025-03-08 16:50:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933052520] [2025-03-08 16:50:21,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:21,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:21,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933052520] [2025-03-08 16:50:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933052520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010428645] [2025-03-08 16:50:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:21,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:21,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:21,903 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:21,947 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-03-08 16:50:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:50:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:21,948 INFO L225 Difference]: With dead ends: 206 [2025-03-08 16:50:21,948 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 16:50:21,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:21,949 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:21,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 16:50:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-08 16:50:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-03-08 16:50:21,958 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-03-08 16:50:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:21,958 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-03-08 16:50:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-03-08 16:50:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:50:21,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:21,960 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:50:21,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1739687945, now seen corresponding path program 1 times [2025-03-08 16:50:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190773923] [2025-03-08 16:50:21,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:21,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:22,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:22,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190773923] [2025-03-08 16:50:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190773923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942287963] [2025-03-08 16:50:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:22,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:22,123 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:22,147 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-08 16:50:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-08 16:50:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:22,149 INFO L225 Difference]: With dead ends: 210 [2025-03-08 16:50:22,149 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:50:22,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:22,150 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:22,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:50:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-08 16:50:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-08 16:50:22,156 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-03-08 16:50:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:22,159 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-08 16:50:22,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-08 16:50:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:50:22,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:22,163 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:50:22,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1740611466, now seen corresponding path program 1 times [2025-03-08 16:50:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521399852] [2025-03-08 16:50:22,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:22,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:50:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:50:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521399852] [2025-03-08 16:50:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521399852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:23,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:50:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378547647] [2025-03-08 16:50:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:23,649 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:23,938 INFO L93 Difference]: Finished difference Result 225 states and 320 transitions. [2025-03-08 16:50:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-08 16:50:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:23,940 INFO L225 Difference]: With dead ends: 225 [2025-03-08 16:50:23,940 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 16:50:23,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-08 16:50:23,941 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:23,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 479 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:50:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 16:50:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-08 16:50:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 99 states have internal predecessors, (130), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:50:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-03-08 16:50:23,954 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 124 [2025-03-08 16:50:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:23,954 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-03-08 16:50:23,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-03-08 16:50:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:50:23,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:23,958 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:50:23,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1913723188, now seen corresponding path program 1 times [2025-03-08 16:50:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126704622] [2025-03-08 16:50:23,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:24,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:24,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:24,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:25,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:25,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126704622] [2025-03-08 16:50:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126704622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206274826] [2025-03-08 16:50:25,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:25,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:25,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:25,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:25,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:50:25,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:25,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:25,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:50:25,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:25,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:25,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:25,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:25,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:25,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 16:50:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 218 proven. 24 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-08 16:50:25,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206274826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:50:25,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:50:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2025-03-08 16:50:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888810643] [2025-03-08 16:50:25,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:50:25,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:50:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:25,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:50:25,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:50:25,735 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2025-03-08 16:50:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:26,692 INFO L93 Difference]: Finished difference Result 244 states and 333 transitions. [2025-03-08 16:50:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:50:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) Word has length 127 [2025-03-08 16:50:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:26,694 INFO L225 Difference]: With dead ends: 244 [2025-03-08 16:50:26,694 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 16:50:26,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 251 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:50:26,695 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 544 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:26,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 511 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:50:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 16:50:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-03-08 16:50:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 108 states have internal predecessors, (138), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:50:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2025-03-08 16:50:26,711 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 127 [2025-03-08 16:50:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:26,711 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2025-03-08 16:50:26,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2025-03-08 16:50:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2025-03-08 16:50:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:50:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:26,713 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:26,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:26,913 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-08 16:50:26,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1658986643, now seen corresponding path program 1 times [2025-03-08 16:50:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725275769] [2025-03-08 16:50:26,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:26,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:26,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:26,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:26,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:27,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725275769] [2025-03-08 16:50:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725275769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:27,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578207512] [2025-03-08 16:50:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:27,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:27,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:27,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:27,504 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:27,847 INFO L93 Difference]: Finished difference Result 285 states and 382 transitions. [2025-03-08 16:50:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:27,847 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:50:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:27,848 INFO L225 Difference]: With dead ends: 285 [2025-03-08 16:50:27,848 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 16:50:27,849 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-08 16:50:27,849 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 117 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:27,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 413 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:50:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 16:50:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-08 16:50:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.255813953488372) internal successors, (162), 130 states have internal predecessors, (162), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 222 transitions. [2025-03-08 16:50:27,873 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 222 transitions. Word has length 127 [2025-03-08 16:50:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:27,873 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 222 transitions. [2025-03-08 16:50:27,873 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 222 transitions. [2025-03-08 16:50:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:50:27,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:27,876 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:50:27,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:27,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1128428844, now seen corresponding path program 1 times [2025-03-08 16:50:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723225850] [2025-03-08 16:50:27,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:27,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:27,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:27,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:27,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723225850] [2025-03-08 16:50:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723225850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342497365] [2025-03-08 16:50:28,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:28,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:28,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:28,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:28,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:50:28,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:29,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 16:50:29,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:29,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:50:29,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 16:50:29,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 16:50:29,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 16:50:29,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 16:50:29,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 16:50:29,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 16:50:29,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 16:50:29,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-03-08 16:50:29,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:29,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 38 [2025-03-08 16:50:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 42 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-08 16:50:29,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:30,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342497365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:50:30,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:50:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-08 16:50:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277737076] [2025-03-08 16:50:30,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:50:30,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 16:50:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:30,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 16:50:30,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:50:30,063 INFO L87 Difference]: Start difference. First operand 167 states and 222 transitions. Second operand has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-08 16:50:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:31,196 INFO L93 Difference]: Finished difference Result 301 states and 394 transitions. [2025-03-08 16:50:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 16:50:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) Word has length 127 [2025-03-08 16:50:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:31,199 INFO L225 Difference]: With dead ends: 301 [2025-03-08 16:50:31,199 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 16:50:31,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 16:50:31,200 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 176 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 597 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:50:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 16:50:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2025-03-08 16:50:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 116 states have internal predecessors, (144), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:50:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2025-03-08 16:50:31,216 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 127 [2025-03-08 16:50:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:31,216 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2025-03-08 16:50:31,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-08 16:50:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2025-03-08 16:50:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:50:31,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:31,218 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:31,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:50:31,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:31,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:31,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1097409037, now seen corresponding path program 1 times [2025-03-08 16:50:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972229754] [2025-03-08 16:50:31,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:31,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:31,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972229754] [2025-03-08 16:50:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972229754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:50:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070817076] [2025-03-08 16:50:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:50:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:32,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:50:32,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:32,417 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:32,981 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2025-03-08 16:50:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:50:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-08 16:50:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:32,982 INFO L225 Difference]: With dead ends: 264 [2025-03-08 16:50:32,982 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 16:50:32,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:32,983 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:32,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 625 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:50:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 16:50:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-08 16:50:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 116 states have internal predecessors, (143), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:50:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2025-03-08 16:50:32,995 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 127 [2025-03-08 16:50:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2025-03-08 16:50:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2025-03-08 16:50:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:50:32,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:32,996 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:32,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:50:32,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:32,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1602967662, now seen corresponding path program 1 times [2025-03-08 16:50:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032803495] [2025-03-08 16:50:32,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:50:33,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:50:33,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:33,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032803495] [2025-03-08 16:50:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032803495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:33,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:50:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333881868] [2025-03-08 16:50:33,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:33,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:33,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:33,381 INFO L87 Difference]: Start difference. First operand 144 states and 185 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:33,574 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2025-03-08 16:50:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-08 16:50:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:33,575 INFO L225 Difference]: With dead ends: 279 [2025-03-08 16:50:33,575 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 16:50:33,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:50:33,576 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 92 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:33,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 533 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 16:50:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-03-08 16:50:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 124 states have internal predecessors, (150), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:50:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 200 transitions. [2025-03-08 16:50:33,591 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 200 transitions. Word has length 127 [2025-03-08 16:50:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:33,592 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 200 transitions. [2025-03-08 16:50:33,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2025-03-08 16:50:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:50:33,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:33,594 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:50:33,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:33,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1287724333, now seen corresponding path program 1 times [2025-03-08 16:50:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173148224] [2025-03-08 16:50:33,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:33,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:33,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:33,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173148224] [2025-03-08 16:50:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173148224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424815359] [2025-03-08 16:50:34,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:34,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:34,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:34,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:50:34,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:35,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:35,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:35,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:35,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 16:50:35,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:35,058 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-08 16:50:35,061 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-08 16:50:35,063 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-08 16:50:35,065 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-08 16:50:35,067 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-08 16:50:35,074 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 92 treesize of output 56 [2025-03-08 16:50:35,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:35,146 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 96 treesize of output 56 [2025-03-08 16:50:35,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:35,165 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 96 treesize of output 65 [2025-03-08 16:50:35,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:35,235 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 109 treesize of output 84 [2025-03-08 16:50:35,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:35,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 87 [2025-03-08 16:50:35,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 234 treesize of output 92 [2025-03-08 16:50:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:35,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424815359] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:50:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 12] total 29 [2025-03-08 16:50:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017969034] [2025-03-08 16:50:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:50:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:36,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:50:36,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:50:36,327 INFO L87 Difference]: Start difference. First operand 158 states and 200 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:36,872 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2025-03-08 16:50:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:50:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:50:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:36,874 INFO L225 Difference]: With dead ends: 184 [2025-03-08 16:50:36,874 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 16:50:36,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:50:36,875 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 415 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:36,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 492 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:50:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 16:50:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-08 16:50:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 140 states have internal predecessors, (169), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-03-08 16:50:36,889 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 129 [2025-03-08 16:50:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-03-08 16:50:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-03-08 16:50:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:50:36,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:36,891 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:36,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:50:37,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:37,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1288647854, now seen corresponding path program 1 times [2025-03-08 16:50:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820087953] [2025-03-08 16:50:37,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:37,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:37,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:37,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:37,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820087953] [2025-03-08 16:50:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820087953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227502] [2025-03-08 16:50:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:37,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:37,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:37,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:37,424 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:37,633 INFO L93 Difference]: Finished difference Result 307 states and 391 transitions. [2025-03-08 16:50:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:50:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:37,634 INFO L225 Difference]: With dead ends: 307 [2025-03-08 16:50:37,636 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 16:50:37,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:37,637 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 105 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:37,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 464 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 16:50:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-08 16:50:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.20863309352518) internal successors, (168), 140 states have internal predecessors, (168), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 228 transitions. [2025-03-08 16:50:37,655 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 228 transitions. Word has length 129 [2025-03-08 16:50:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:37,655 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 228 transitions. [2025-03-08 16:50:37,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 228 transitions. [2025-03-08 16:50:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:50:37,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:37,656 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:37,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:50:37,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:37,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2118815761, now seen corresponding path program 1 times [2025-03-08 16:50:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:37,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931025923] [2025-03-08 16:50:37,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:37,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:37,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:37,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:37,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:37,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931025923] [2025-03-08 16:50:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931025923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001562643] [2025-03-08 16:50:37,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:37,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:37,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:37,990 INFO L87 Difference]: Start difference. First operand 180 states and 228 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:38,165 INFO L93 Difference]: Finished difference Result 305 states and 387 transitions. [2025-03-08 16:50:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:50:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:38,168 INFO L225 Difference]: With dead ends: 305 [2025-03-08 16:50:38,168 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 16:50:38,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:38,169 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 76 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:38,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 379 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 16:50:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 16:50:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 140 states have internal predecessors, (167), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2025-03-08 16:50:38,189 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 129 [2025-03-08 16:50:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2025-03-08 16:50:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2025-03-08 16:50:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:50:38,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:38,191 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:50:38,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:38,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 368697072, now seen corresponding path program 1 times [2025-03-08 16:50:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562667498] [2025-03-08 16:50:38,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:38,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:38,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:38,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:38,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:39,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562667498] [2025-03-08 16:50:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562667498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930338396] [2025-03-08 16:50:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:39,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:39,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:39,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:50:39,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:50:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:50:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:39,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:50:39,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:39,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:39,926 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 113 treesize of output 64 [2025-03-08 16:50:40,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:40,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 143 [2025-03-08 16:50:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:40,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:40,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930338396] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:40,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:50:40,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17, 8] total 20 [2025-03-08 16:50:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613783484] [2025-03-08 16:50:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:40,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:40,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:50:40,308 INFO L87 Difference]: Start difference. First operand 180 states and 227 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:40,589 INFO L93 Difference]: Finished difference Result 378 states and 473 transitions. [2025-03-08 16:50:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:40,589 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:50:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:40,591 INFO L225 Difference]: With dead ends: 378 [2025-03-08 16:50:40,591 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 16:50:40,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:50:40,592 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:40,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 617 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 16:50:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2025-03-08 16:50:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 157 states have internal predecessors, (189), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2025-03-08 16:50:40,610 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 129 [2025-03-08 16:50:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:40,611 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2025-03-08 16:50:40,611 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2025-03-08 16:50:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:50:40,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:40,613 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:40,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:50:40,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 16:50:40,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1382310781, now seen corresponding path program 1 times [2025-03-08 16:50:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999116665] [2025-03-08 16:50:40,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:40,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:50:40,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:50:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999116665] [2025-03-08 16:50:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999116665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:41,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:41,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84874487] [2025-03-08 16:50:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:41,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:41,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:41,342 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:41,521 INFO L93 Difference]: Finished difference Result 339 states and 429 transitions. [2025-03-08 16:50:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:41,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:50:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:41,522 INFO L225 Difference]: With dead ends: 339 [2025-03-08 16:50:41,522 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:50:41,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:41,523 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:41,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 273 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:50:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 16:50:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.205128205128205) internal successors, (188), 157 states have internal predecessors, (188), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:50:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 248 transitions. [2025-03-08 16:50:41,540 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 248 transitions. Word has length 131 [2025-03-08 16:50:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:41,542 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 248 transitions. [2025-03-08 16:50:41,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 248 transitions. [2025-03-08 16:50:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:50:41,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:41,543 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:41,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:50:41,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:41,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1315304028, now seen corresponding path program 1 times [2025-03-08 16:50:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324695996] [2025-03-08 16:50:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:41,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:50:41,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:50:41,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:41,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-08 16:50:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324695996] [2025-03-08 16:50:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324695996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345914081] [2025-03-08 16:50:42,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:42,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:42,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:50:42,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:50:42,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:50:42,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:42,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:42,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 16:50:42,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:42,760 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-08 16:50:42,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:42,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:42,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:42,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:50:42,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2025-03-08 16:50:43,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:43,003 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 64 treesize of output 42 [2025-03-08 16:50:43,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:43,032 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 64 treesize of output 42 [2025-03-08 16:50:43,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:43,080 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 62 treesize of output 58 [2025-03-08 16:50:43,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:43,166 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 76 treesize of output 24 [2025-03-08 16:50:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-08 16:50:43,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:50:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345914081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:50:43,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:50:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 33 [2025-03-08 16:50:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072110466] [2025-03-08 16:50:43,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:50:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 16:50:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 16:50:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:50:43,856 INFO L87 Difference]: Start difference. First operand 197 states and 248 transitions. Second operand has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) [2025-03-08 16:50:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:46,137 INFO L93 Difference]: Finished difference Result 369 states and 451 transitions. [2025-03-08 16:50:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 16:50:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) Word has length 131 [2025-03-08 16:50:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:46,140 INFO L225 Difference]: With dead ends: 369 [2025-03-08 16:50:46,140 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 16:50:46,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 16:50:46,142 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 779 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:46,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 622 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:50:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 16:50:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 209. [2025-03-08 16:50:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 167 states have internal predecessors, (197), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:50:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 253 transitions. [2025-03-08 16:50:46,176 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 253 transitions. Word has length 131 [2025-03-08 16:50:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 253 transitions. [2025-03-08 16:50:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) [2025-03-08 16:50:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 253 transitions. [2025-03-08 16:50:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:50:46,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:46,177 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:46,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:50:46,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 16:50:46,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1203712340, now seen corresponding path program 1 times [2025-03-08 16:50:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841549376] [2025-03-08 16:50:46,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:50:46,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:50:46,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:50:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841549376] [2025-03-08 16:50:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841549376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:50:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011357131] [2025-03-08 16:50:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:46,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:46,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:46,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:50:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:50:46,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:50:46,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:46,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:46,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:50:46,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:46,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011357131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:50:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:50:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93613146] [2025-03-08 16:50:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:46,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:46,772 INFO L87 Difference]: Start difference. First operand 209 states and 253 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:46,815 INFO L93 Difference]: Finished difference Result 367 states and 445 transitions. [2025-03-08 16:50:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-08 16:50:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:46,816 INFO L225 Difference]: With dead ends: 367 [2025-03-08 16:50:46,816 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 16:50:46,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:46,817 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:46,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 16:50:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-03-08 16:50:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 167 states have (on average 1.18562874251497) internal successors, (198), 168 states have internal predecessors, (198), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:50:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 254 transitions. [2025-03-08 16:50:46,837 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 254 transitions. Word has length 133 [2025-03-08 16:50:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:46,837 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 254 transitions. [2025-03-08 16:50:46,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 254 transitions. [2025-03-08 16:50:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:50:46,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:46,838 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:46,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 16:50:47,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:47,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:47,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash -707236203, now seen corresponding path program 1 times [2025-03-08 16:50:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854131212] [2025-03-08 16:50:47,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:47,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:47,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:47,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:50:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920673156] [2025-03-08 16:50:47,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:47,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:47,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:47,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:50:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:47,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:47,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 16:50:47,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:47,541 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-08 16:50:47,543 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-08 16:50:47,545 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-08 16:50:47,547 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-08 16:50:47,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-03-08 16:50:47,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:47,628 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 105 treesize of output 59 [2025-03-08 16:50:47,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 68 [2025-03-08 16:50:47,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:47,767 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 137 treesize of output 94 [2025-03-08 16:50:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:47,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854131212] [2025-03-08 16:50:47,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:50:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920673156] [2025-03-08 16:50:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920673156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:50:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952699036] [2025-03-08 16:50:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:47,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:47,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:47,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:47,775 INFO L87 Difference]: Start difference. First operand 210 states and 254 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:48,221 INFO L93 Difference]: Finished difference Result 366 states and 444 transitions. [2025-03-08 16:50:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:50:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:48,223 INFO L225 Difference]: With dead ends: 366 [2025-03-08 16:50:48,223 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 16:50:48,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:48,223 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 87 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:48,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 385 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:50:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 16:50:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 16:50:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 169 states have internal predecessors, (199), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:50:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2025-03-08 16:50:48,261 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 135 [2025-03-08 16:50:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:48,265 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2025-03-08 16:50:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2025-03-08 16:50:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:50:48,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:48,266 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:48,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 16:50:48,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 16:50:48,467 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:48,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -356436266, now seen corresponding path program 1 times [2025-03-08 16:50:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005800991] [2025-03-08 16:50:48,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:48,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:50:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548232436] [2025-03-08 16:50:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:48,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:48,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:48,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 16:50:48,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:48,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:48,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:48,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:48,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 16:50:48,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:48,908 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-08 16:50:48,910 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-08 16:50:48,914 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-08 16:50:48,918 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-08 16:50:48,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-03-08 16:50:49,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:49,009 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 105 treesize of output 59 [2025-03-08 16:50:49,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:49,031 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 105 treesize of output 68 [2025-03-08 16:50:49,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:49,085 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 116 treesize of output 71 [2025-03-08 16:50:49,244 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 115 treesize of output 87 [2025-03-08 16:50:49,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 127 [2025-03-08 16:50:49,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2025-03-08 16:50:49,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:49,352 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 188 treesize of output 56 [2025-03-08 16:50:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:49,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005800991] [2025-03-08 16:50:49,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:50:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548232436] [2025-03-08 16:50:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548232436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:49,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:50:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692226823] [2025-03-08 16:50:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:49,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:50:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:49,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:50:49,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:49,401 INFO L87 Difference]: Start difference. First operand 211 states and 255 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:50,281 INFO L93 Difference]: Finished difference Result 449 states and 545 transitions. [2025-03-08 16:50:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:50:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:50:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:50,284 INFO L225 Difference]: With dead ends: 449 [2025-03-08 16:50:50,284 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 16:50:50,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:50:50,285 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 226 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:50,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 719 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:50:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 16:50:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 220. [2025-03-08 16:50:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.192090395480226) internal successors, (211), 178 states have internal predecessors, (211), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:50:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2025-03-08 16:50:50,310 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 135 [2025-03-08 16:50:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:50,310 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2025-03-08 16:50:50,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2025-03-08 16:50:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:50:50,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:50,311 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:50,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:50,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -765260491, now seen corresponding path program 1 times [2025-03-08 16:50:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63680360] [2025-03-08 16:50:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:50,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:50,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:50,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:50:50,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379566401] [2025-03-08 16:50:50,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:50,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:50,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:50,589 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:50:50,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 16:50:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:51,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:51,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:50:51,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:50:51,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:50:51,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:50:51,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:50:51,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:50:51,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:50:51,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:50:51,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:50:52,183 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:52,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:50:52,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:50:52 BoogieIcfgContainer [2025-03-08 16:50:52,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:50:52,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:50:52,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:50:52,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:50:52,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:20" (3/4) ... [2025-03-08 16:50:52,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:50:52,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:50:52,226 INFO L158 Benchmark]: Toolchain (without parser) took 32707.91ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 109.7MB in the beginning and 39.7MB in the end (delta: 69.9MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.20ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.92ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: Boogie Preprocessor took 42.94ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: IcfgBuilder took 576.17ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 51.7MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: TraceAbstraction took 31814.20ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.7MB in the beginning and 39.8MB in the end (delta: 10.9MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2025-03-08 16:50:52,226 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 39.8MB in the beginning and 39.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:50:52,228 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.20ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.92ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.94ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 576.17ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 51.7MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31814.20ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.7MB in the beginning and 39.8MB in the end (delta: 10.9MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 39.8MB in the beginning and 39.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 8, 59049, 100, 16, -25, 16, 25, -10, 0, 25.1, 2531521428, -128, 256, -16 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] 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] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) 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_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -63) 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_10 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) 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_13 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) 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_13 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L58] EXPR WrapperStruct00.var_1_8 [L58] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_8 [L59] EXPR WrapperStruct00.var_1_14 [L59] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_14 [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L60] EXPR WrapperStruct00.var_1_14 [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L60] signed long int stepLocal_0 = (((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)); [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2] [L61] COND FALSE !(WrapperStruct00.var_1_2 <= stepLocal_0) [L64] EXPR WrapperStruct00.var_1_10 [L64] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_16 [L66] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_15 [L67] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L72] EXPR WrapperStruct00.var_1_1 [L72] unsigned char stepLocal_1 = WrapperStruct00.var_1_1; [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L73] COND FALSE !(2.75f > WrapperStruct00.var_1_12) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] COND TRUE (WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > stepLocal_1 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) [L77] EXPR WrapperStruct00.var_1_8 [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] WrapperStruct00.var_1_11 = ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_3 [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_6 [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) [L109] EXPR WrapperStruct00.var_1_11 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR WrapperStruct00.var_1_8 [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) ; [L119] RET, EXPR property() [L119] 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, 104 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2926 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2921 mSDsluCounter, 9159 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6900 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6568 IncrementalHoareTripleChecker+Invalid, 7270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 2259 mSDtfsCounter, 6568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2114 GetRequests, 1853 SyntacticMatches, 11 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=19, InterpolantAutomatonStates: 168, 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, 19 MinimizatonAttempts, 206 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 3876 NumberOfCodeBlocks, 3876 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3948 ConstructedInterpolants, 1 QuantifiedInterpolants, 25305 SizeOfPredicates, 26 NumberOfNonLiveVariables, 4632 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 12590/13020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:50:52,277 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-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:50:54,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:50:54,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:50:54,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:50:54,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:50:54,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:50:54,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:50:54,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:50:54,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:50:54,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:50:54,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:50:54,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:50:54,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:50:54,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:50:54,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:54,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:50:54,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:50:54,110 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2025-03-08 16:50:54,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:50:54,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:50:54,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:50:54,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:50:54,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:50:54,363 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-37.i [2025-03-08 16:50:55,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7db0741e/85b5711c2e6b4d049a2eedeed4c55984/FLAGf56e8c70e [2025-03-08 16:50:55,686 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:50:55,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2025-03-08 16:50:55,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7db0741e/85b5711c2e6b4d049a2eedeed4c55984/FLAGf56e8c70e [2025-03-08 16:50:55,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7db0741e/85b5711c2e6b4d049a2eedeed4c55984 [2025-03-08 16:50:55,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:50:55,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:50:55,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:55,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:50:55,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:50:55,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:55,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d2d08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55, skipping insertion in model container [2025-03-08 16:50:55,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:55,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:50:55,828 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-37.i[916,929] [2025-03-08 16:50:55,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:55,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:50:55,913 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-37.i[916,929] [2025-03-08 16:50:55,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:50:55,983 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:50:55,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55 WrapperNode [2025-03-08 16:50:55,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:50:55,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:55,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:50:55,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:50:55,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,030 INFO L138 Inliner]: procedures = 37, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-03-08 16:50:56,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:50:56,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:50:56,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:50:56,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:50:56,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,060 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-03-08 16:50:56,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:50:56,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:50:56,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:50:56,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:50:56,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ... [2025-03-08 16:50:56,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:50:56,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:50:56,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:50:56,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:50:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:50:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:50:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:50:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 16:50:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 16:50:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:50:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:50:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:50:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:50:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:50:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:50:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:50:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:50:56,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:50:56,266 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:50:56,760 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite78#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem83#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem92#1;havoc property_#t~ite114#1;havoc property_#t~mem95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem107#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-03-08 16:50:56,815 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-08 16:50:56,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:50:56,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:50:56,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:50:56,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:56 BoogieIcfgContainer [2025-03-08 16:50:56,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:50:56,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:50:56,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:50:56,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:50:56,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:50:55" (1/3) ... [2025-03-08 16:50:56,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6ba9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:56, skipping insertion in model container [2025-03-08 16:50:56,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (2/3) ... [2025-03-08 16:50:56,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6ba9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:56, skipping insertion in model container [2025-03-08 16:50:56,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:56" (3/3) ... [2025-03-08 16:50:56,831 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2025-03-08 16:50:56,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:50:56,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:50:56,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:50:56,892 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;@64460a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:50:56,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:50:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:56,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:56,908 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:56,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:56,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1440740167, now seen corresponding path program 1 times [2025-03-08 16:50:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984841897] [2025-03-08 16:50:56,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:56,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:56,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:56,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:56,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:50:57,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:57,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:57,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:57,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:57,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:50:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 16:50:57,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:57,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984841897] [2025-03-08 16:50:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984841897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:57,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:57,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:50:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624764789] [2025-03-08 16:50:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:50:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:57,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:50:57,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:50:57,221 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:57,237 INFO L93 Difference]: Finished difference Result 186 states and 286 transitions. [2025-03-08 16:50:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:50:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-08 16:50:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:57,245 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:50:57,246 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:50:57,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:50:57,252 INFO L435 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:57,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:50:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:50:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-08 16:50:57,285 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2025-03-08 16:50:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:57,286 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-08 16:50:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-08 16:50:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:57,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:57,290 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:57,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:57,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:57,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:57,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -201986512, now seen corresponding path program 1 times [2025-03-08 16:50:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275661189] [2025-03-08 16:50:57,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:57,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:57,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:57,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:57,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:50:57,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:57,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:57,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:57,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:50:57,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:50:57,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:57,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275661189] [2025-03-08 16:50:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275661189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:57,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:57,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:50:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358677581] [2025-03-08 16:50:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:57,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:50:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:57,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:50:57,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:57,778 INFO L87 Difference]: Start difference. First operand 93 states and 133 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:57,834 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2025-03-08 16:50:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:50:57,837 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-08 16:50:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:57,838 INFO L225 Difference]: With dead ends: 185 [2025-03-08 16:50:57,838 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 16:50:57,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:50:57,842 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:57,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 16:50:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 16:50:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-08 16:50:57,852 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 122 [2025-03-08 16:50:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-08 16:50:57,853 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:50:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-08 16:50:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:57,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:57,854 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:57,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:50:58,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:58,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:58,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1498753967, now seen corresponding path program 1 times [2025-03-08 16:50:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:58,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981959033] [2025-03-08 16:50:58,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:58,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:50:58,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:58,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:58,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:50:58,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:58,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:58,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:58,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981959033] [2025-03-08 16:50:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981959033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:58,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47659293] [2025-03-08 16:50:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:58,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:58,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:58,275 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:58,316 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2025-03-08 16:50:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:50:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:58,318 INFO L225 Difference]: With dead ends: 192 [2025-03-08 16:50:58,318 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 16:50:58,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 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-08 16:50:58,319 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:58,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 16:50:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-08 16:50:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-03-08 16:50:58,325 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 122 [2025-03-08 16:50:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:58,325 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-03-08 16:50:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-03-08 16:50:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:58,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:58,327 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:58,335 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-08 16:50:58,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:58,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:58,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:58,532 INFO L85 PathProgramCache]: Analyzing trace with hash -308700496, now seen corresponding path program 1 times [2025-03-08 16:50:58,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:58,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651317794] [2025-03-08 16:50:58,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:58,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:58,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:50:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:58,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:58,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:58,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:50:58,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:58,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:58,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:58,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651317794] [2025-03-08 16:50:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651317794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:58,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:50:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583656096] [2025-03-08 16:50:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:58,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:50:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:58,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:50:58,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:58,756 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:58,804 INFO L93 Difference]: Finished difference Result 198 states and 279 transitions. [2025-03-08 16:50:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:50:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:50:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:58,807 INFO L225 Difference]: With dead ends: 198 [2025-03-08 16:50:58,807 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 16:50:58,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:58,809 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:58,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:50:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 16:50:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-08 16:50:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-08 16:50:58,821 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 122 [2025-03-08 16:50:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-08 16:50:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-08 16:50:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:58,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:58,822 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:58,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:50:59,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:59,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash 578803185, now seen corresponding path program 1 times [2025-03-08 16:50:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354362993] [2025-03-08 16:50:59,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:59,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:59,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:50:59,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:59,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:59,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:59,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:59,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:50:59,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:50:59,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:50:59,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:50:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354362993] [2025-03-08 16:50:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354362993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:50:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884259526] [2025-03-08 16:50:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:50:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:50:59,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:50:59,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:59,235 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:59,297 INFO L93 Difference]: Finished difference Result 202 states and 283 transitions. [2025-03-08 16:50:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:50:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:50:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:59,299 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:50:59,299 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:50:59,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:50:59,300 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:59,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 725 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:50:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-08 16:50:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:50:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2025-03-08 16:50:59,305 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 122 [2025-03-08 16:50:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2025-03-08 16:50:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:50:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2025-03-08 16:50:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:50:59,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:59,307 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:59,316 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:50:59,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:59,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:59,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 579726706, now seen corresponding path program 1 times [2025-03-08 16:50:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:50:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99755150] [2025-03-08 16:50:59,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:50:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:50:59,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:50:59,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:50:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:50:59,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:50:59,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:59,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:50:59,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:50:59,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:50:59,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 26 treesize of output 25 [2025-03-08 16:50:59,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:50:59,940 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 36 treesize of output 38 [2025-03-08 16:51:00,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:00,106 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 51 treesize of output 41 [2025-03-08 16:51:00,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:00,217 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 51 treesize of output 41 [2025-03-08 16:51:00,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:00,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2025-03-08 16:51:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 286 proven. 24 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 16:51:00,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:51:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:51:00,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:51:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99755150] [2025-03-08 16:51:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99755150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:51:00,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:51:00,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2025-03-08 16:51:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127138250] [2025-03-08 16:51:00,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:51:00,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:51:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:51:00,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:51:00,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:51:00,578 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-08 16:51:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:51:01,376 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2025-03-08 16:51:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:51:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 122 [2025-03-08 16:51:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:51:01,379 INFO L225 Difference]: With dead ends: 217 [2025-03-08 16:51:01,379 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 16:51:01,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:51:01,380 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 303 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:51:01,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 234 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:51:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 16:51:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-08 16:51:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:51:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2025-03-08 16:51:01,398 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 122 [2025-03-08 16:51:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:51:01,398 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2025-03-08 16:51:01,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-08 16:51:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2025-03-08 16:51:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:51:01,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:51:01,399 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:51:01,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:51:01,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:51:01,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:51:01,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:51:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1824491187, now seen corresponding path program 1 times [2025-03-08 16:51:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:51:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477683721] [2025-03-08 16:51:01,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:51:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:51:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:51:01,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:51:01,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:51:01,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:51:01,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:51:01,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:51:01,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:51:01,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 16:51:01,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:51:01,860 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-08 16:51:01,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:51:01,939 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-08 16:51:02,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2025-03-08 16:51:02,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:02,301 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 62 treesize of output 46 [2025-03-08 16:51:02,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:02,457 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 57 treesize of output 56 [2025-03-08 16:51:02,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:02,676 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 72 treesize of output 59 [2025-03-08 16:51:02,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:02,795 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 72 treesize of output 59 [2025-03-08 16:51:03,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:03,009 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 89 treesize of output 83 [2025-03-08 16:51:03,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:03,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 39 [2025-03-08 16:51:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 289 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 16:51:03,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:51:03,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:51:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477683721] [2025-03-08 16:51:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477683721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:51:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1316467605] [2025-03-08 16:51:03,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:51:03,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:51:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:51:03,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:51:03,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 16:51:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:51:04,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:51:04,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:51:04,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:51:04,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:51:04,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:51:04,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:51:04,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-08 16:51:04,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:04,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 16:51:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 16:51:04,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 16:51:04,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:04,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-03-08 16:51:05,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:05,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-03-08 16:51:05,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:05,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-03-08 16:51:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2025-03-08 16:51:05,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:05,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 37 [2025-03-08 16:51:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 245 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:51:05,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:51:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1316467605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:51:05,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:51:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-03-08 16:51:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372636399] [2025-03-08 16:51:05,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:51:05,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 16:51:05,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:51:05,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 16:51:05,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 16:51:05,728 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) [2025-03-08 16:51:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:51:09,383 INFO L93 Difference]: Finished difference Result 251 states and 319 transitions. [2025-03-08 16:51:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 16:51:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) Word has length 122 [2025-03-08 16:51:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:51:09,385 INFO L225 Difference]: With dead ends: 251 [2025-03-08 16:51:09,385 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 16:51:09,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 370 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=870, Invalid=3290, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 16:51:09,387 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 487 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:51:09,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 631 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 16:51:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 16:51:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-03-08 16:51:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:51:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2025-03-08 16:51:09,406 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 122 [2025-03-08 16:51:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:51:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2025-03-08 16:51:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) [2025-03-08 16:51:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2025-03-08 16:51:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:51:09,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:51:09,409 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:51:09,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-08 16:51:09,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-08 16:51:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:51:09,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:51:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:51:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2035842100, now seen corresponding path program 1 times [2025-03-08 16:51:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:51:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450808507] [2025-03-08 16:51:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:51:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:51:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:51:09,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:51:09,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:51:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:51:10,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:51:10,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:51:10,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:51:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 16:51:10,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:51:10,058 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-08 16:51:10,141 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 36 treesize of output 29 [2025-03-08 16:51:10,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:10,315 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 62 treesize of output 37 [2025-03-08 16:51:10,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 37 [2025-03-08 16:51:10,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:10,966 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 89 treesize of output 70 [2025-03-08 16:51:11,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:11,258 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 99 treesize of output 83 [2025-03-08 16:51:11,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:11,661 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 103 treesize of output 81 [2025-03-08 16:51:11,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:11,865 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 103 treesize of output 81 [2025-03-08 16:51:12,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:12,186 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 120 treesize of output 105 [2025-03-08 16:51:12,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:12,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 113 [2025-03-08 16:51:12,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:12,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 152 treesize of output 62 [2025-03-08 16:51:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 267 proven. 102 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 16:51:12,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:51:17,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:51:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450808507] [2025-03-08 16:51:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450808507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:51:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1478122867] [2025-03-08 16:51:17,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:51:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:51:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:51:17,963 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:51:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-08 16:51:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:51:18,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:51:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:51:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:51:18,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 16:51:18,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:51:18,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:51:18,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-08 16:51:20,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:20,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2025-03-08 16:51:21,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-03-08 16:51:32,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 60 [2025-03-08 16:51:33,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:33,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 71 [2025-03-08 16:51:35,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:35,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 74 [2025-03-08 16:51:35,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 74 [2025-03-08 16:51:35,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:35,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 94 [2025-03-08 16:51:36,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:36,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 109 [2025-03-08 16:51:36,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:51:36,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 66 [2025-03-08 16:51:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 267 proven. 102 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 16:51:36,339 INFO L312 TraceCheckSpWp]: Computing backward predicates...