./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.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 ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:40,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:40,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:59:40,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:40,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:40,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:40,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:40,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:40,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:40,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:40,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:40,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:40,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:40,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:40,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:40,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:40,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:40,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:40,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:40,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:40,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:59:40,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:40,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:40,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:40,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:40,667 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 -> ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 [2025-03-17 05:59:40,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:40,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:40,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:40,946 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:40,947 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-61.i [2025-03-17 05:59:42,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf748946/10b484ef582e4c508cc81d8c0f78a06f/FLAG50c8607e6 [2025-03-17 05:59:42,413 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:42,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2025-03-17 05:59:42,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf748946/10b484ef582e4c508cc81d8c0f78a06f/FLAG50c8607e6 [2025-03-17 05:59:42,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf748946/10b484ef582e4c508cc81d8c0f78a06f [2025-03-17 05:59:42,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:42,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:42,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:42,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:42,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:42,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42, skipping insertion in model container [2025-03-17 05:59:42,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:42,608 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-61.i[916,929] [2025-03-17 05:59:42,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:42,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:42,684 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-61.i[916,929] [2025-03-17 05:59:42,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:42,746 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:59:42,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42 WrapperNode [2025-03-17 05:59:42,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:42,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:42,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:59:42,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:59:42,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,815 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2025-03-17 05:59:42,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:42,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:59:42,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:59:42,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:59:42,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,843 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:59:42,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:59:42,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:59:42,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:59:42,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:59:42,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (1/1) ... [2025-03-17 05:59:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:42,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:59:42,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:59:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:59:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:59:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:59:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:59:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:59:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:59:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:59:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:59:42,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:59:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:59:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:59:42,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:59:43,081 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:59:43,083 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:59:43,637 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short88#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#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~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short129#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1; [2025-03-17 05:59:43,684 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-17 05:59:43,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:59:43,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:59:43,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:59:43,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:43 BoogieIcfgContainer [2025-03-17 05:59:43,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:59:43,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:59:43,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:59:43,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:59:43,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:59:42" (1/3) ... [2025-03-17 05:59:43,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ac642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:43, skipping insertion in model container [2025-03-17 05:59:43,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:42" (2/3) ... [2025-03-17 05:59:43,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ac642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:43, skipping insertion in model container [2025-03-17 05:59:43,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:43" (3/3) ... [2025-03-17 05:59:43,707 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-61.i [2025-03-17 05:59:43,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:59:43,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-61.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:59:43,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:59:43,801 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;@752fc152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:59:43,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:59:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:59:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:59:43,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:43,822 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:43,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:43,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash 957150762, now seen corresponding path program 1 times [2025-03-17 05:59:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243469465] [2025-03-17 05:59:43,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:44,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:44,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:44,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:44,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 05:59:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243469465] [2025-03-17 05:59:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243469465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25331074] [2025-03-17 05:59:44,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:44,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:59:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:44,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:44,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:44,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:44,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:59:44,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 05:59:44,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25331074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:59:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687536915] [2025-03-17 05:59:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:59:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:44,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:59:44,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:44,784 INFO L87 Difference]: Start difference. First operand has 114 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:59:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:44,806 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2025-03-17 05:59:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:59:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 186 [2025-03-17 05:59:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:44,814 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:59:44,815 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:59:44,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:44,821 INFO L435 NwaCegarLoop]: 164 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, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:44,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:59:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 05:59:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:59:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2025-03-17 05:59:44,869 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 186 [2025-03-17 05:59:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2025-03-17 05:59:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:59:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2025-03-17 05:59:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:59:44,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:44,873 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:44,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:45,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:59:45,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1366988243, now seen corresponding path program 1 times [2025-03-17 05:59:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679301243] [2025-03-17 05:59:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:45,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:45,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:45,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:45,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:59:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679301243] [2025-03-17 05:59:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679301243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:45,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721117558] [2025-03-17 05:59:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:45,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:45,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:45,646 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:45,702 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2025-03-17 05:59:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 05:59:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:45,705 INFO L225 Difference]: With dead ends: 226 [2025-03-17 05:59:45,705 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 05:59:45,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:45,706 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:45,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 05:59:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-17 05:59:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:59:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2025-03-17 05:59:45,722 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 186 [2025-03-17 05:59:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2025-03-17 05:59:45,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2025-03-17 05:59:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:59:45,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:45,731 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:45,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:59:45,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash -440466220, now seen corresponding path program 1 times [2025-03-17 05:59:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158939734] [2025-03-17 05:59:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:45,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:45,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:45,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:45,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:59:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:46,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158939734] [2025-03-17 05:59:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158939734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462974916] [2025-03-17 05:59:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:46,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:46,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:46,083 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:46,129 INFO L93 Difference]: Finished difference Result 230 states and 335 transitions. [2025-03-17 05:59:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 05:59:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:46,134 INFO L225 Difference]: With dead ends: 230 [2025-03-17 05:59:46,135 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:59:46,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:46,139 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:46,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:59:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-17 05:59:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:59:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-17 05:59:46,154 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 186 [2025-03-17 05:59:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:46,156 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-17 05:59:46,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-17 05:59:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:59:46,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:46,162 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:59:46,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 447037461, now seen corresponding path program 1 times [2025-03-17 05:59:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176992823] [2025-03-17 05:59:46,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:46,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:46,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:46,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:46,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:59:46,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:46,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176992823] [2025-03-17 05:59:46,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176992823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:46,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:46,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161256114] [2025-03-17 05:59:46,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:46,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:46,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:46,498 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:46,531 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2025-03-17 05:59:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 05:59:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:46,535 INFO L225 Difference]: With dead ends: 234 [2025-03-17 05:59:46,536 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 05:59:46,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:46,539 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:46,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 05:59:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-17 05:59:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:59:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-17 05:59:46,557 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 186 [2025-03-17 05:59:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:46,558 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-17 05:59:46,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 05:59:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-17 05:59:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:59:46,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:46,562 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:46,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:59:46,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 447960982, now seen corresponding path program 1 times [2025-03-17 05:59:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:46,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678713323] [2025-03-17 05:59:46,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:46,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:46,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:46,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 05:59:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678713323] [2025-03-17 05:59:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678713323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328810878] [2025-03-17 05:59:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:48,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:59:48,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:59:49,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:59:49,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:49,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:49,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 05:59:49,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:49,399 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-17 05:59:49,475 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-17 05:59:49,551 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-17 05:59:49,626 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-17 05:59:49,698 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-17 05:59:49,764 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-17 05:59:49,837 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-17 05:59:49,902 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-17 05:59:49,971 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-17 05:59:50,059 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-17 05:59:50,147 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-17 05:59:50,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:50,231 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 61 treesize of output 72 [2025-03-17 05:59:50,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 122 [2025-03-17 05:59:50,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 186 [2025-03-17 05:59:50,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 92 [2025-03-17 05:59:50,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:50,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 66 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 207 treesize of output 160 [2025-03-17 05:59:51,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 204 treesize of output 163 [2025-03-17 05:59:51,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 204 treesize of output 163 [2025-03-17 05:59:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-17 05:59:51,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 05:59:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328810878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:52,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 27 [2025-03-17 05:59:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392918305] [2025-03-17 05:59:52,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 05:59:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:52,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 05:59:52,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:59:52,212 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 27 states have internal predecessors, (163), 9 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 5 states have call predecessors, (75), 9 states have call successors, (75) [2025-03-17 05:59:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:55,542 INFO L93 Difference]: Finished difference Result 318 states and 445 transitions. [2025-03-17 05:59:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 05:59:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 27 states have internal predecessors, (163), 9 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 5 states have call predecessors, (75), 9 states have call successors, (75) Word has length 186 [2025-03-17 05:59:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:55,544 INFO L225 Difference]: With dead ends: 318 [2025-03-17 05:59:55,544 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 05:59:55,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 05:59:55,546 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 710 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:55,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 672 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 05:59:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 05:59:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2025-03-17 05:59:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.3125) internal successors, (147), 113 states have internal predecessors, (147), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:59:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2025-03-17 05:59:55,562 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 186 [2025-03-17 05:59:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2025-03-17 05:59:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 27 states have internal predecessors, (163), 9 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 5 states have call predecessors, (75), 9 states have call successors, (75) [2025-03-17 05:59:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2025-03-17 05:59:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 05:59:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:55,568 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:55,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:59:55,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:55,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1787038323, now seen corresponding path program 1 times [2025-03-17 05:59:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4941404] [2025-03-17 05:59:55,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 05:59:55,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 05:59:55,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:59:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4941404] [2025-03-17 05:59:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4941404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682339419] [2025-03-17 05:59:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:57,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:57,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:57,216 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:59:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:57,666 INFO L93 Difference]: Finished difference Result 281 states and 388 transitions. [2025-03-17 05:59:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 188 [2025-03-17 05:59:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:57,669 INFO L225 Difference]: With dead ends: 281 [2025-03-17 05:59:57,669 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 05:59:57,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:57,670 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 79 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:57,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 465 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:59:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 05:59:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2025-03-17 05:59:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 103 states have internal predecessors, (129), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:59:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2025-03-17 05:59:57,688 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 188 [2025-03-17 05:59:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:57,688 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2025-03-17 05:59:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:59:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2025-03-17 05:59:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 05:59:57,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:57,690 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:59:57,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:59:57,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash -817754923, now seen corresponding path program 1 times [2025-03-17 05:59:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297139814] [2025-03-17 05:59:57,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:57,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 05:59:57,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 05:59:57,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 05:59:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297139814] [2025-03-17 05:59:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297139814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804522239] [2025-03-17 05:59:59,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:59,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:59,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:59,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:59:59,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 05:59:59,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 05:59:59,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:59,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:59,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-17 05:59:59,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:00,005 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-17 06:00:00,057 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-17 06:00:00,099 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-17 06:00:00,142 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-17 06:00:00,188 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-17 06:00:00,233 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-17 06:00:00,277 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-17 06:00:00,320 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-17 06:00:00,358 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-17 06:00:00,399 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-17 06:00:00,440 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-17 06:00:00,489 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-17 06:00:00,559 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-17 06:00:00,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2025-03-17 06:00:00,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 73 [2025-03-17 06:00:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:00:00,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2025-03-17 06:00:00,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:00,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 21 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 73 [2025-03-17 06:00:00,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:00,805 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 96 treesize of output 83 [2025-03-17 06:00:00,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:00,945 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 107 treesize of output 86 [2025-03-17 06:00:01,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:01,085 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 124 treesize of output 64 [2025-03-17 06:00:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 216 proven. 132 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2025-03-17 06:00:01,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 06:00:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804522239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:01,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:00:01,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 28 [2025-03-17 06:00:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718885136] [2025-03-17 06:00:01,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 06:00:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:01,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 06:00:01,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-17 06:00:01,727 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) [2025-03-17 06:00:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:03,992 INFO L93 Difference]: Finished difference Result 454 states and 611 transitions. [2025-03-17 06:00:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 06:00:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) Word has length 188 [2025-03-17 06:00:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:04,001 INFO L225 Difference]: With dead ends: 454 [2025-03-17 06:00:04,002 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 06:00:04,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 06:00:04,004 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 873 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:04,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 704 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 06:00:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 06:00:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 139. [2025-03-17 06:00:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.2844036697247707) internal successors, (140), 109 states have internal predecessors, (140), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2025-03-17 06:00:04,024 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 188 [2025-03-17 06:00:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:04,025 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2025-03-17 06:00:04,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 8 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 8 states have call successors, (72) [2025-03-17 06:00:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2025-03-17 06:00:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:04,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:04,027 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:04,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:00:04,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1814827276, now seen corresponding path program 1 times [2025-03-17 06:00:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798735129] [2025-03-17 06:00:04,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:04,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:04,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 06:00:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798735129] [2025-03-17 06:00:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798735129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933648398] [2025-03-17 06:00:06,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:06,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:06,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:06,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:00:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 06:00:06,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:06,453 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-17 06:00:06,493 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-17 06:00:06,531 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-17 06:00:06,577 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-17 06:00:06,612 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-17 06:00:06,649 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-17 06:00:06,691 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-17 06:00:06,728 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-17 06:00:06,772 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-17 06:00:06,812 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-17 06:00:06,851 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-17 06:00:06,891 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-17 06:00:06,942 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-17 06:00:06,966 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 73 treesize of output 51 [2025-03-17 06:00:06,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 73 [2025-03-17 06:00:06,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-03-17 06:00:07,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:07,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 57 [2025-03-17 06:00:07,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:07,133 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 83 treesize of output 57 [2025-03-17 06:00:07,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:07,201 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 83 treesize of output 57 [2025-03-17 06:00:07,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:07,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 53 [2025-03-17 06:00:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 118 proven. 69 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2025-03-17 06:00:07,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 06:00:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933648398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:07,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:00:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-17 06:00:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372431860] [2025-03-17 06:00:07,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:00:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:00:07,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:00:07,564 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 16 states, 13 states have (on average 10.461538461538462) internal successors, (136), 16 states have internal predecessors, (136), 7 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 4 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-17 06:00:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:08,402 INFO L93 Difference]: Finished difference Result 343 states and 470 transitions. [2025-03-17 06:00:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:00:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.461538461538462) internal successors, (136), 16 states have internal predecessors, (136), 7 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 4 states have call predecessors, (75), 7 states have call successors, (75) Word has length 188 [2025-03-17 06:00:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:08,408 INFO L225 Difference]: With dead ends: 343 [2025-03-17 06:00:08,408 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 06:00:08,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:00:08,408 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 408 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:08,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 288 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:00:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 06:00:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 139. [2025-03-17 06:00:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 109 states have internal predecessors, (138), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2025-03-17 06:00:08,425 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 188 [2025-03-17 06:00:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:08,426 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2025-03-17 06:00:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.461538461538462) internal successors, (136), 16 states have internal predecessors, (136), 7 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 4 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-17 06:00:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2025-03-17 06:00:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:08,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:08,430 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:08,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:00:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:08,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:08,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1524274265, now seen corresponding path program 1 times [2025-03-17 06:00:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373824597] [2025-03-17 06:00:08,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:08,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373824597] [2025-03-17 06:00:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373824597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:00:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348454040] [2025-03-17 06:00:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:10,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:10,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:10,405 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:10,789 INFO L93 Difference]: Finished difference Result 327 states and 441 transitions. [2025-03-17 06:00:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 188 [2025-03-17 06:00:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:10,790 INFO L225 Difference]: With dead ends: 327 [2025-03-17 06:00:10,791 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 06:00:10,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:00:10,792 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 60 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:10,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 681 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:00:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 06:00:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 141. [2025-03-17 06:00:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2025-03-17 06:00:10,805 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 188 [2025-03-17 06:00:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2025-03-17 06:00:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2025-03-17 06:00:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:10,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:10,807 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:10,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:00:10,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:10,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash 527201912, now seen corresponding path program 1 times [2025-03-17 06:00:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879539384] [2025-03-17 06:00:10,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:10,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:10,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:10,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:10,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:00:11,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:11,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:11,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:11,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:11,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:00:11,166 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:00:11,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:00:11,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:00:11,171 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:11,235 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:00:11,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:00:11 BoogieIcfgContainer [2025-03-17 06:00:11,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:00:11,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:00:11,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:00:11,240 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:00:11,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:43" (3/4) ... [2025-03-17 06:00:11,242 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:00:11,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:00:11,243 INFO L158 Benchmark]: Toolchain (without parser) took 28804.74ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 111.9MB in the beginning and 900.2MB in the end (delta: -788.3MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:11,243 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:11,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.00ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 92.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:11,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.22ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 88.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:00:11,244 INFO L158 Benchmark]: Boogie Preprocessor took 77.57ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:11,244 INFO L158 Benchmark]: IcfgBuilder took 800.41ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 48.9MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:00:11,244 INFO L158 Benchmark]: TraceAbstraction took 27541.84ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 48.4MB in the beginning and 900.3MB in the end (delta: -851.9MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-03-17 06:00:11,245 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 1.0GB. Free memory was 900.3MB in the beginning and 900.2MB in the end (delta: 159.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:11,246 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.40ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.00ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 92.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.22ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 88.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.57ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 800.41ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 48.9MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27541.84ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 48.4MB in the beginning and 900.3MB in the end (delta: -851.9MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 1.0GB. Free memory was 900.3MB in the beginning and 900.2MB in the end (delta: 159.2kB). 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 138, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L44] unsigned char isInitial = 0; [L45-L66] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 8, 128, 64, 100, 5, 100, 32, 64, 50, 8, 0, 0, 255.5, 255.5, 64, 32.5 }; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L129] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L130] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L132] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L133] EXPR WrapperStruct00.var_1_21 [L133] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L133] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L133] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 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] [L133] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L146] RET updateVariables() [L147] CALL step() [L70] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND TRUE WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_10 [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1] [L71] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))) [L75] EXPR WrapperStruct00.var_1_6 [L75] EXPR WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] unsigned char stepLocal_0 = WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4; [L76] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1] [L76] COND TRUE WrapperStruct00.var_1_5 || stepLocal_0 [L77] EXPR WrapperStruct00.var_1_15 [L77] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_21 [L79] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L80] EXPR WrapperStruct00.var_1_18 [L80] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_18 [L81] WrapperStruct00.var_1_23 = 0.010000000000000009 [L82] EXPR WrapperStruct00.var_1_20 [L82] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] COND FALSE !(WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) [L85] EXPR WrapperStruct00.var_1_20 [L85] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] COND TRUE WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_5 [L86] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L91] EXPR WrapperStruct00.var_1_23 [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) [L91] EXPR WrapperStruct00.var_1_20 [L91] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] COND TRUE WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20))) [L92] EXPR WrapperStruct00.var_1_9 [L92] EXPR WrapperStruct00.var_1_10 [L92] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) [L138] EXPR WrapperStruct00.var_1_20 [L138] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L138] EXPR WrapperStruct00.var_1_1 [L138] EXPR WrapperStruct00.var_1_6 [L138] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR ((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] EXPR (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) VAL [WrapperStruct00={4:0}, isInitial=1] [L138-L139] return (((((((WrapperStruct00.var_1_20 < WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_23 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_20)))) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : 1)) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_10 + ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))) : (WrapperStruct00.var_1_11 == ((unsigned char) (((64 + WrapperStruct00.var_1_14) + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16)) - (WrapperStruct00.var_1_17 + WrapperStruct00.var_1_18)))))) && ((WrapperStruct00.var_1_5 || (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_15)) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((unsigned short int) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_23 == ((double) 0.010000000000000009)) ; [L148] RET, EXPR property() [L148] 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, 114 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 10, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2146 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2133 mSDsluCounter, 4394 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3284 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4970 IncrementalHoareTripleChecker+Invalid, 5216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 1110 mSDtfsCounter, 4970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 1359 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=5, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 370 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 2618 NumberOfCodeBlocks, 2618 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2976 ConstructedInterpolants, 0 QuantifiedInterpolants, 17698 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2694 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 18501/19200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:00:11,272 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-61.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 ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:00:13,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:00:13,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:00:13,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:00:13,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:00:13,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:00:13,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:00:13,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:00:13,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:00:13,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:00:13,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:00:13,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:00:13,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:00:13,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:00:13,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:00:13,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:13,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:00:13,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:00:13,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:00:13,748 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 -> ac494cf4bb95ee7173afff6e37d6c8217c99c93b386253d4b81910df4df15de3 [2025-03-17 06:00:14,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:00:14,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:00:14,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:00:14,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:00:14,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:00:14,074 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-61.i [2025-03-17 06:00:15,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1fe9f04/09675b5bea564b9c91f117cc57dc5fa4/FLAG74c16a86f [2025-03-17 06:00:15,597 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:00:15,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-61.i [2025-03-17 06:00:15,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1fe9f04/09675b5bea564b9c91f117cc57dc5fa4/FLAG74c16a86f [2025-03-17 06:00:15,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1fe9f04/09675b5bea564b9c91f117cc57dc5fa4 [2025-03-17 06:00:15,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:00:15,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:00:15,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:15,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:00:15,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:00:15,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:15,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff76fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15, skipping insertion in model container [2025-03-17 06:00:15,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:15,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:00:15,765 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-61.i[916,929] [2025-03-17 06:00:15,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:15,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:00:15,865 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-61.i[916,929] [2025-03-17 06:00:15,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:15,940 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:00:15,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15 WrapperNode [2025-03-17 06:00:15,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:15,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:15,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:00:15,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:00:15,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:15,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,022 INFO L138 Inliner]: procedures = 37, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2025-03-17 06:00:16,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:16,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:00:16,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:00:16,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:00:16,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,076 INFO L175 MemorySlicer]: Split 148 memory accesses to 2 slices as follows [2, 146]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 44 writes are split as follows [0, 44]. [2025-03-17 06:00:16,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:00:16,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:00:16,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:00:16,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:00:16,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (1/1) ... [2025-03-17 06:00:16,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:16,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:00:16,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:00:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:00:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:00:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:00:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:00:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:00:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:00:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:00:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:00:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:00:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:00:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:00:16,344 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:00:16,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:00:17,343 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short88#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#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~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short129#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1; [2025-03-17 06:00:17,366 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 06:00:17,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:00:17,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:00:17,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:00:17,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:17 BoogieIcfgContainer [2025-03-17 06:00:17,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:00:17,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:00:17,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:00:17,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:00:17,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:00:15" (1/3) ... [2025-03-17 06:00:17,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d5ea74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:17, skipping insertion in model container [2025-03-17 06:00:17,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:15" (2/3) ... [2025-03-17 06:00:17,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d5ea74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:17, skipping insertion in model container [2025-03-17 06:00:17,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:17" (3/3) ... [2025-03-17 06:00:17,399 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-61.i [2025-03-17 06:00:17,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:00:17,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-61.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:00:17,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:00:17,479 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;@77ea8842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:00:17,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:00:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:17,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:17,497 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:17,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1215429147, now seen corresponding path program 1 times [2025-03-17 06:00:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954688313] [2025-03-17 06:00:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:17,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:17,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:00:17,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:17,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:17,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:17,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:17,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:00:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-17 06:00:17,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:17,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:17,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954688313] [2025-03-17 06:00:17,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954688313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:17,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:17,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:00:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025477396] [2025-03-17 06:00:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:17,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:00:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:00:17,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:17,953 INFO L87 Difference]: Start difference. First operand has 114 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:18,000 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2025-03-17 06:00:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:00:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 186 [2025-03-17 06:00:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:18,008 INFO L225 Difference]: With dead ends: 225 [2025-03-17 06:00:18,008 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 06:00:18,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:18,015 INFO L435 NwaCegarLoop]: 164 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, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:18,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 06:00:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 06:00:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2025-03-17 06:00:18,058 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 186 [2025-03-17 06:00:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:18,058 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2025-03-17 06:00:18,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2025-03-17 06:00:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:18,062 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:18,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:00:18,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:18,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1625266628, now seen corresponding path program 1 times [2025-03-17 06:00:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331519120] [2025-03-17 06:00:18,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:18,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:18,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:18,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:00:18,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:18,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:18,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:00:18,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:18,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:18,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331519120] [2025-03-17 06:00:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331519120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781869644] [2025-03-17 06:00:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:18,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:18,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:18,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:18,664 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:18,755 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-17 06:00:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 06:00:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:18,759 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:00:18,759 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 06:00:18,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-17 06:00:18,760 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:18,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 764 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 06:00:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-17 06:00:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-17 06:00:18,776 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 186 [2025-03-17 06:00:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:18,777 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-17 06:00:18,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-17 06:00:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:18,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:18,780 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:18,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:00:18,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:18,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:18,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash -182187835, now seen corresponding path program 1 times [2025-03-17 06:00:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560437210] [2025-03-17 06:00:18,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:18,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:18,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:00:19,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:19,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:19,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:00:19,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:19,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:19,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560437210] [2025-03-17 06:00:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560437210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:00:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223736278] [2025-03-17 06:00:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:19,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:19,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:19,335 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:19,439 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2025-03-17 06:00:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 06:00:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:19,442 INFO L225 Difference]: With dead ends: 238 [2025-03-17 06:00:19,442 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 06:00:19,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 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-17 06:00:19,446 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:19,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 905 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 06:00:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-17 06:00:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-03-17 06:00:19,462 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 186 [2025-03-17 06:00:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:19,464 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-03-17 06:00:19,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-03-17 06:00:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:19,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:19,471 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:19,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:00:19,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:19,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:19,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 705315846, now seen corresponding path program 1 times [2025-03-17 06:00:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211893050] [2025-03-17 06:00:19,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:19,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:00:19,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:19,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:19,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:00:19,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:20,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:20,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211893050] [2025-03-17 06:00:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211893050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237333105] [2025-03-17 06:00:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:20,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:20,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:20,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:20,023 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:20,120 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2025-03-17 06:00:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:00:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 06:00:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:20,122 INFO L225 Difference]: With dead ends: 242 [2025-03-17 06:00:20,122 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 06:00:20,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:20,123 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:20,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1048 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 06:00:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-17 06:00:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2025-03-17 06:00:20,131 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 186 [2025-03-17 06:00:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2025-03-17 06:00:20,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2025-03-17 06:00:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:20,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:20,136 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:20,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:00:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:20,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash 706239367, now seen corresponding path program 1 times [2025-03-17 06:00:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885563348] [2025-03-17 06:00:20,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:20,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:20,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:00:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:20,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:20,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:20,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:20,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:20,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:20,656 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 55 treesize of output 19 [2025-03-17 06:00:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:20,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:20,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885563348] [2025-03-17 06:00:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885563348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:00:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669085696] [2025-03-17 06:00:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:20,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:00:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:20,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:00:20,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:00:20,695 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:20,835 INFO L93 Difference]: Finished difference Result 243 states and 347 transitions. [2025-03-17 06:00:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:00:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 06:00:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:20,838 INFO L225 Difference]: With dead ends: 243 [2025-03-17 06:00:20,838 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 06:00:20,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:00:20,839 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:20,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 06:00:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 06:00:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2025-03-17 06:00:20,850 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 186 [2025-03-17 06:00:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:20,850 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2025-03-17 06:00:20,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2025-03-17 06:00:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:20,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:20,851 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:20,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:00:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:21,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:21,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1331816922, now seen corresponding path program 1 times [2025-03-17 06:00:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602251861] [2025-03-17 06:00:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:21,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:21,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:21,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:21,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:00:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:21,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:21,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:21,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:21,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:21,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:21,359 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 55 treesize of output 19 [2025-03-17 06:00:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:21,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:21,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602251861] [2025-03-17 06:00:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602251861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:21,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:21,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:00:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515988211] [2025-03-17 06:00:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:00:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:00:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:00:21,378 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:21,402 INFO L93 Difference]: Finished difference Result 241 states and 342 transitions. [2025-03-17 06:00:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:00:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2025-03-17 06:00:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:21,404 INFO L225 Difference]: With dead ends: 241 [2025-03-17 06:00:21,405 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 06:00:21,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:00:21,405 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 06:00:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 06:00:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:00:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-03-17 06:00:21,420 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 186 [2025-03-17 06:00:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:21,421 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-03-17 06:00:21,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-03-17 06:00:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:00:21,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:21,422 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:21,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:00:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:21,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1010212266, now seen corresponding path program 1 times [2025-03-17 06:00:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713048869] [2025-03-17 06:00:21,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:21,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:21,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:21,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:00:21,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:00:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:00:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:22,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 06:00:22,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:22,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:00:22,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-03-17 06:00:22,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:22,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 06:00:22,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:22,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 06:00:22,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:22,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 06:00:23,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-03-17 06:00:23,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:23,161 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 47 treesize of output 43 [2025-03-17 06:00:23,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:23,438 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-17 06:00:23,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:23,602 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-17 06:00:23,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:23,945 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-17 06:00:24,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:24,192 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-17 06:00:24,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:24,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 27 [2025-03-17 06:00:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 814 proven. 114 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-17 06:00:24,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-17 06:00:24,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:24,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713048869] [2025-03-17 06:00:24,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713048869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:24,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:24,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2025-03-17 06:00:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266616638] [2025-03-17 06:00:24,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:24,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:00:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:24,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:00:24,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:00:24,856 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 19 states, 15 states have (on average 7.2) internal successors, (108), 18 states have internal predecessors, (108), 9 states have call successors, (46), 5 states have call predecessors, (46), 7 states have return successors, (46), 6 states have call predecessors, (46), 9 states have call successors, (46) [2025-03-17 06:00:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:27,757 INFO L93 Difference]: Finished difference Result 270 states and 368 transitions. [2025-03-17 06:00:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 06:00:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 7.2) internal successors, (108), 18 states have internal predecessors, (108), 9 states have call successors, (46), 5 states have call predecessors, (46), 7 states have return successors, (46), 6 states have call predecessors, (46), 9 states have call successors, (46) Word has length 186 [2025-03-17 06:00:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:27,761 INFO L225 Difference]: With dead ends: 270 [2025-03-17 06:00:27,761 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 06:00:27,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2025-03-17 06:00:27,762 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 77 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:27,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 430 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 06:00:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 06:00:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2025-03-17 06:00:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 110 states have internal predecessors, (134), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:00:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2025-03-17 06:00:27,777 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 186 [2025-03-17 06:00:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2025-03-17 06:00:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 7.2) internal successors, (108), 18 states have internal predecessors, (108), 9 states have call successors, (46), 5 states have call predecessors, (46), 7 states have return successors, (46), 6 states have call predecessors, (46), 9 states have call successors, (46) [2025-03-17 06:00:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2025-03-17 06:00:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:27,779 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:27,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:00:27,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:27,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:27,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2109458776, now seen corresponding path program 1 times [2025-03-17 06:00:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538472277] [2025-03-17 06:00:27,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:27,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:00:28,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:28,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:28,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 06:00:28,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:28,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:00:28,501 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 42 treesize of output 20 [2025-03-17 06:00:28,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-03-17 06:00:28,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:28,735 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 47 treesize of output 43 [2025-03-17 06:00:28,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:28,990 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-17 06:00:29,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:29,134 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-17 06:00:29,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:29,404 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-17 06:00:29,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:29,609 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-17 06:00:29,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:29,772 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 67 treesize of output 69 [2025-03-17 06:00:30,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:30,051 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 82 treesize of output 72 [2025-03-17 06:00:30,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:30,280 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 82 treesize of output 72 [2025-03-17 06:00:30,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:30,497 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 81 treesize of output 86 [2025-03-17 06:00:30,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:30,604 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 104 treesize of output 50 [2025-03-17 06:00:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 926 proven. 114 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-17 06:00:30,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-17 06:00:30,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:30,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538472277] [2025-03-17 06:00:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538472277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:30,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:30,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 20 [2025-03-17 06:00:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288702445] [2025-03-17 06:00:30,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 06:00:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:30,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 06:00:30,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:00:30,988 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 20 states, 16 states have (on average 7.4375) internal successors, (119), 20 states have internal predecessors, (119), 11 states have call successors, (46), 7 states have call predecessors, (46), 9 states have return successors, (46), 7 states have call predecessors, (46), 11 states have call successors, (46) [2025-03-17 06:00:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:33,737 INFO L93 Difference]: Finished difference Result 306 states and 394 transitions. [2025-03-17 06:00:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 06:00:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 7.4375) internal successors, (119), 20 states have internal predecessors, (119), 11 states have call successors, (46), 7 states have call predecessors, (46), 9 states have return successors, (46), 7 states have call predecessors, (46), 11 states have call successors, (46) Word has length 188 [2025-03-17 06:00:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:33,739 INFO L225 Difference]: With dead ends: 306 [2025-03-17 06:00:33,740 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 06:00:33,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=427, Invalid=1133, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 06:00:33,741 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 280 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:33,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 378 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 06:00:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 06:00:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2025-03-17 06:00:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 122 states have internal predecessors, (145), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:00:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 203 transitions. [2025-03-17 06:00:33,758 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 203 transitions. Word has length 188 [2025-03-17 06:00:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:33,758 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 203 transitions. [2025-03-17 06:00:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 7.4375) internal successors, (119), 20 states have internal predecessors, (119), 11 states have call successors, (46), 7 states have call predecessors, (46), 9 states have return successors, (46), 7 states have call predecessors, (46), 11 states have call successors, (46) [2025-03-17 06:00:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 203 transitions. [2025-03-17 06:00:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:33,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:33,760 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:33,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:00:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:33,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1416357079, now seen corresponding path program 1 times [2025-03-17 06:00:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265411333] [2025-03-17 06:00:33,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:33,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:33,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:00:34,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:34,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:34,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:34,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:34,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 06:00:34,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:00:34,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-03-17 06:00:34,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:34,483 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-17 06:00:34,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:34,586 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 46 treesize of output 51 [2025-03-17 06:00:34,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:34,753 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 61 treesize of output 54 [2025-03-17 06:00:34,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:34,909 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 56 treesize of output 64 [2025-03-17 06:00:35,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,157 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 71 treesize of output 67 [2025-03-17 06:00:35,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,402 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 66 treesize of output 77 [2025-03-17 06:00:35,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,703 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 81 treesize of output 80 [2025-03-17 06:00:35,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,931 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 76 treesize of output 90 [2025-03-17 06:00:36,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:36,326 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 91 treesize of output 93 [2025-03-17 06:00:36,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:36,596 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 91 treesize of output 93 [2025-03-17 06:00:36,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:36,835 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 90 treesize of output 107 [2025-03-17 06:00:37,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 110 [2025-03-17 06:00:37,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:37,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 128 treesize of output 130 [2025-03-17 06:00:39,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:39,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 125 treesize of output 145 [2025-03-17 06:00:39,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:39,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 140 treesize of output 148 [2025-03-17 06:00:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:39,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 165 treesize of output 75 [2025-03-17 06:00:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 1002 proven. 63 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-17 06:00:39,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:39,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265411333] [2025-03-17 06:00:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265411333] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2025-03-17 06:00:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076928572] [2025-03-17 06:00:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:39,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=332, Unknown=1, NotChecked=0, Total=420 [2025-03-17 06:00:39,891 INFO L87 Difference]: Start difference. First operand 160 states and 203 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:40,559 INFO L93 Difference]: Finished difference Result 374 states and 472 transitions. [2025-03-17 06:00:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 188 [2025-03-17 06:00:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:40,563 INFO L225 Difference]: With dead ends: 374 [2025-03-17 06:00:40,563 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 06:00:40,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=452, Unknown=1, NotChecked=0, Total=552 [2025-03-17 06:00:40,564 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:40,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 597 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:00:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 06:00:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2025-03-17 06:00:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.2259887005649717) internal successors, (217), 179 states have internal predecessors, (217), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 06:00:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2025-03-17 06:00:40,585 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 188 [2025-03-17 06:00:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:40,586 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2025-03-17 06:00:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 06:00:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2025-03-17 06:00:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:40,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:40,588 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:40,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 06:00:40,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:40,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:40,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1881537864, now seen corresponding path program 1 times [2025-03-17 06:00:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766191119] [2025-03-17 06:00:40,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:40,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:40,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 06:00:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:41,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:41,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:41,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:41,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 06:00:41,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:41,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 8 treesize of output 1 [2025-03-17 06:00:41,739 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 79 treesize of output 48 [2025-03-17 06:00:41,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:41,853 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 94 treesize of output 51 [2025-03-17 06:00:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:00:41,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:41,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 104 [2025-03-17 06:00:42,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:42,091 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 165 treesize of output 119 [2025-03-17 06:00:42,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:42,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 239 treesize of output 85 [2025-03-17 06:00:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 06:00:42,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:42,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766191119] [2025-03-17 06:00:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766191119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:00:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434615756] [2025-03-17 06:00:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:42,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:00:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:42,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:00:42,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:00:42,567 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:46,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:00:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:51,778 INFO L93 Difference]: Finished difference Result 638 states and 805 transitions. [2025-03-17 06:00:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:00:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 188 [2025-03-17 06:00:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:51,782 INFO L225 Difference]: With dead ends: 638 [2025-03-17 06:00:51,784 INFO L226 Difference]: Without dead ends: 431 [2025-03-17 06:00:51,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:00:51,785 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 554 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:51,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 457 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-17 06:00:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-17 06:00:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2025-03-17 06:00:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 344 states have (on average 1.2238372093023255) internal successors, (421), 348 states have internal predecessors, (421), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 06:00:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 537 transitions. [2025-03-17 06:00:51,836 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 537 transitions. Word has length 188 [2025-03-17 06:00:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 537 transitions. [2025-03-17 06:00:51,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 06:00:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 537 transitions. [2025-03-17 06:00:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:00:51,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:51,840 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:51,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 06:00:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:52,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2092888777, now seen corresponding path program 1 times [2025-03-17 06:00:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555351341] [2025-03-17 06:00:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:52,045 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:52,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 06:00:52,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:00:52,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:00:52,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:52,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:52,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:00:52,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:52,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:00:52,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:52,420 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 47 treesize of output 37 [2025-03-17 06:00:52,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:52,495 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 97 treesize of output 33 [2025-03-17 06:00:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 06:00:52,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:52,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555351341] [2025-03-17 06:00:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555351341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626188067] [2025-03-17 06:00:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:52,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:52,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:52,533 INFO L87 Difference]: Start difference. First operand 425 states and 537 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)