./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-a_file-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:04:19,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:04:19,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:04:19,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:04:19,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:04:19,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:04:19,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:04:19,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:04:19,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:04:19,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:04:19,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:04:19,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:04:19,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:04:19,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:04:19,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:04:19,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:04:19,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:04:19,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:04:19,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:04:19,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:04:19,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:04:19,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:04:19,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:04:19,620 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2025-03-04 01:04:19,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:04:19,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:04:19,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:04:19,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:04:19,821 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:04:19,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:20,983 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7adc895/5f1aa1724e7b46e1b4b76cb60ee515c3/FLAGee57a7fc4 [2025-03-04 01:04:21,206 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:04:21,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:21,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7adc895/5f1aa1724e7b46e1b4b76cb60ee515c3/FLAGee57a7fc4 [2025-03-04 01:04:21,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7adc895/5f1aa1724e7b46e1b4b76cb60ee515c3 [2025-03-04 01:04:21,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:04:21,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:04:21,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:04:21,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:04:21,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:04:21,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291d7be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21, skipping insertion in model container [2025-03-04 01:04:21,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:04:21,656 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-a_file-31.i[916,929] [2025-03-04 01:04:21,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:04:21,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:04:21,731 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-a_file-31.i[916,929] [2025-03-04 01:04:21,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:04:21,785 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:04:21,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21 WrapperNode [2025-03-04 01:04:21,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:04:21,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:04:21,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:04:21,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:04:21,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,838 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-03-04 01:04:21,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:04:21,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:04:21,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:04:21,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:04:21,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,864 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-03-04 01:04:21,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:04:21,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:04:21,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:04:21,889 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:04:21,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (1/1) ... [2025-03-04 01:04:21,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:04:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:21,923 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-04 01:04:21,927 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-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:04:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:04:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:04:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:04:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:04:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:04:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:04:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:04:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:04:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:04:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:04:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:04:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:04:21,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:04:22,036 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:04:22,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:04:22,330 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-04 01:04:22,350 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-04 01:04:22,350 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:04:22,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:04:22,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:04:22,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:22 BoogieIcfgContainer [2025-03-04 01:04:22,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:04:22,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:04:22,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:04:22,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:04:22,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:04:21" (1/3) ... [2025-03-04 01:04:22,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6043e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:22, skipping insertion in model container [2025-03-04 01:04:22,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:21" (2/3) ... [2025-03-04 01:04:22,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6043e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:22, skipping insertion in model container [2025-03-04 01:04:22,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:22" (3/3) ... [2025-03-04 01:04:22,367 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:22,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:04:22,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:04:22,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:04:22,426 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;@1dd2638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:04:22,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:04:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:22,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:22,437 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:22,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:22,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-03-04 01:04:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044005286] [2025-03-04 01:04:22,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:22,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:22,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:22,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:22,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:04:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:22,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044005286] [2025-03-04 01:04:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044005286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20284554] [2025-03-04 01:04:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:22,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:22,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:22,678 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-04 01:04:22,680 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-04 01:04:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:22,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:22,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:22,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:22,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:04:22,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:04:22,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20284554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:04:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731142806] [2025-03-04 01:04:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:22,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:04:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:22,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:04:22,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:04:22,862 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:22,880 INFO L93 Difference]: Finished difference Result 166 states and 258 transitions. [2025-03-04 01:04:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:04:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:04:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:22,887 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:04:22,887 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:04:22,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-04 01:04:22,892 INFO L435 NwaCegarLoop]: 121 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, 121 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-04 01:04:22,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:04:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:04:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-04 01:04:22,925 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2025-03-04 01:04:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:22,925 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-04 01:04:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-04 01:04:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:22,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:22,928 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:22,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:04:23,128 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-04 01:04:23,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:23,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-03-04 01:04:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:23,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808520485] [2025-03-04 01:04:23,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:23,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:23,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:23,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808520485] [2025-03-04 01:04:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808520485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:04:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892985980] [2025-03-04 01:04:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:04:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:23,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:04:23,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:04:23,747 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:23,815 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2025-03-04 01:04:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:04:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:04:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:23,817 INFO L225 Difference]: With dead ends: 163 [2025-03-04 01:04:23,817 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:04:23,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-04 01:04:23,818 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:23,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:04:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:04:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-04 01:04:23,828 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2025-03-04 01:04:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-04 01:04:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-04 01:04:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:23,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:23,833 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:23,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:04:23,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:23,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-03-04 01:04:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99570231] [2025-03-04 01:04:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:23,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:23,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:23,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99570231] [2025-03-04 01:04:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99570231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:04:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974047722] [2025-03-04 01:04:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:04:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:24,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:04:24,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:24,666 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:24,862 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2025-03-04 01:04:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:04:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:04:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:24,863 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:04:24,864 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:04:24,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:24,865 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 79 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:24,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 706 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:04:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-03-04 01:04:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 119 states have internal predecessors, (164), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-03-04 01:04:24,889 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 94 [2025-03-04 01:04:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:24,890 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-03-04 01:04:24,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-03-04 01:04:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:24,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:24,891 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:04:24,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-03-04 01:04:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436168611] [2025-03-04 01:04:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:24,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436168611] [2025-03-04 01:04:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436168611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:04:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402591665] [2025-03-04 01:04:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:25,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:04:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:25,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:04:25,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:04:25,039 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:25,077 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2025-03-04 01:04:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:04:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:04:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:25,080 INFO L225 Difference]: With dead ends: 275 [2025-03-04 01:04:25,081 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 01:04:25,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:04:25,083 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:25,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 01:04:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 01:04:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 119 states have internal predecessors, (162), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2025-03-04 01:04:25,103 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 96 [2025-03-04 01:04:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2025-03-04 01:04:25,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2025-03-04 01:04:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:25,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:25,105 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:04:25,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:25,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-03-04 01:04:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355623582] [2025-03-04 01:04:25,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:25,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:25,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:25,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:25,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:26,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:26,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355623582] [2025-03-04 01:04:26,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355623582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:26,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:04:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518149071] [2025-03-04 01:04:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:04:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:26,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:04:26,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:26,136 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:04:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:26,597 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2025-03-04 01:04:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:04:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-04 01:04:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:26,599 INFO L225 Difference]: With dead ends: 307 [2025-03-04 01:04:26,599 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 01:04:26,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:04:26,600 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 164 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:26,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1226 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:04:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 01:04:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2025-03-04 01:04:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-03-04 01:04:26,614 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 96 [2025-03-04 01:04:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-03-04 01:04:26,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:04:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-03-04 01:04:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:26,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:26,617 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:04:26,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-03-04 01:04:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182321681] [2025-03-04 01:04:26,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:26,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:26,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:26,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182321681] [2025-03-04 01:04:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182321681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343303327] [2025-03-04 01:04:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:26,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:26,825 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:26,907 INFO L93 Difference]: Finished difference Result 249 states and 343 transitions. [2025-03-04 01:04:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:26,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-04 01:04:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:26,909 INFO L225 Difference]: With dead ends: 249 [2025-03-04 01:04:26,909 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 01:04:26,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04 01:04:26,909 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 110 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:26,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 520 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 01:04:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-03-04 01:04:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:04:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2025-03-04 01:04:26,930 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 96 [2025-03-04 01:04:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:26,930 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2025-03-04 01:04:26,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2025-03-04 01:04:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:04:26,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:26,931 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:26,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:04:26,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:26,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-03-04 01:04:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896686352] [2025-03-04 01:04:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:26,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:04:26,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:04:26,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:26,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896686352] [2025-03-04 01:04:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896686352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010528812] [2025-03-04 01:04:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:27,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:27,120 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:27,222 INFO L93 Difference]: Finished difference Result 285 states and 386 transitions. [2025-03-04 01:04:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-03-04 01:04:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:27,224 INFO L225 Difference]: With dead ends: 285 [2025-03-04 01:04:27,224 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 01:04:27,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:27,224 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:27,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 534 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 01:04:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-03-04 01:04:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2025-03-04 01:04:27,236 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 97 [2025-03-04 01:04:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:27,236 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2025-03-04 01:04:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2025-03-04 01:04:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:04:27,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:27,237 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:04:27,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-03-04 01:04:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950323546] [2025-03-04 01:04:27,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:27,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:04:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:04:27,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:27,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950323546] [2025-03-04 01:04:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950323546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:04:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808050042] [2025-03-04 01:04:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:04:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:27,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:04:27,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:04:27,573 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:27,722 INFO L93 Difference]: Finished difference Result 304 states and 408 transitions. [2025-03-04 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:04:27,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-04 01:04:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:27,723 INFO L225 Difference]: With dead ends: 304 [2025-03-04 01:04:27,724 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 01:04:27,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:27,724 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 91 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:27,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 804 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 01:04:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2025-03-04 01:04:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 172 states have (on average 1.302325581395349) internal successors, (224), 174 states have internal predecessors, (224), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:04:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 278 transitions. [2025-03-04 01:04:27,751 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 278 transitions. Word has length 98 [2025-03-04 01:04:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:27,751 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 278 transitions. [2025-03-04 01:04:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 278 transitions. [2025-03-04 01:04:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:04:27,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:27,753 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:04:27,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-03-04 01:04:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736321500] [2025-03-04 01:04:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:27,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:27,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:27,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:04:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254212641] [2025-03-04 01:04:27,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:27,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:27,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:27,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:04:27,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:04:27,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:27,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:04:27,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:28,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:04:28,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:04:28,300 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 31 treesize of output 25 [2025-03-04 01:04:28,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:28,316 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 78 treesize of output 47 [2025-03-04 01:04:28,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:28,372 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 69 treesize of output 41 [2025-03-04 01:04:28,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:28,441 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 66 treesize of output 22 [2025-03-04 01:04:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:28,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736321500] [2025-03-04 01:04:28,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:04:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254212641] [2025-03-04 01:04:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254212641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:04:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692818503] [2025-03-04 01:04:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:28,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:04:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:04:28,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:04:28,458 INFO L87 Difference]: Start difference. First operand 207 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:28,677 INFO L93 Difference]: Finished difference Result 508 states and 685 transitions. [2025-03-04 01:04:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:04:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:04:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:28,679 INFO L225 Difference]: With dead ends: 508 [2025-03-04 01:04:28,679 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 01:04:28,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:28,680 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:28,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 786 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 01:04:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 286. [2025-03-04 01:04:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.3142857142857143) internal successors, (322), 246 states have internal predecessors, (322), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:04:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 384 transitions. [2025-03-04 01:04:28,709 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 384 transitions. Word has length 99 [2025-03-04 01:04:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:28,709 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 384 transitions. [2025-03-04 01:04:28,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 384 transitions. [2025-03-04 01:04:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:04:28,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:28,710 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:28,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:04:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 01:04:28,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1283544114, now seen corresponding path program 1 times [2025-03-04 01:04:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665209499] [2025-03-04 01:04:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:28,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665209499] [2025-03-04 01:04:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665209499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490493171] [2025-03-04 01:04:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:29,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:29,051 INFO L87 Difference]: Start difference. First operand 286 states and 384 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:29,172 INFO L93 Difference]: Finished difference Result 631 states and 842 transitions. [2025-03-04 01:04:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:04:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:04:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:29,174 INFO L225 Difference]: With dead ends: 631 [2025-03-04 01:04:29,176 INFO L226 Difference]: Without dead ends: 445 [2025-03-04 01:04:29,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:29,177 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 71 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:29,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 781 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-04 01:04:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 306. [2025-03-04 01:04:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 265 states have (on average 1.320754716981132) internal successors, (350), 266 states have internal predecessors, (350), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:04:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 412 transitions. [2025-03-04 01:04:29,205 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 412 transitions. Word has length 99 [2025-03-04 01:04:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:29,206 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 412 transitions. [2025-03-04 01:04:29,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 412 transitions. [2025-03-04 01:04:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:04:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:29,207 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:04:29,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1794078291, now seen corresponding path program 1 times [2025-03-04 01:04:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922528508] [2025-03-04 01:04:29,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:29,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:29,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:29,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922528508] [2025-03-04 01:04:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922528508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753475426] [2025-03-04 01:04:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:29,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:29,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:29,352 INFO L87 Difference]: Start difference. First operand 306 states and 412 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:29,507 INFO L93 Difference]: Finished difference Result 685 states and 913 transitions. [2025-03-04 01:04:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:04:29,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:04:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:29,511 INFO L225 Difference]: With dead ends: 685 [2025-03-04 01:04:29,511 INFO L226 Difference]: Without dead ends: 469 [2025-03-04 01:04:29,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04 01:04:29,513 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:29,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 564 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-04 01:04:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 330. [2025-03-04 01:04:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 288 states have (on average 1.3229166666666667) internal successors, (381), 289 states have internal predecessors, (381), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:04:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 443 transitions. [2025-03-04 01:04:29,550 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 443 transitions. Word has length 99 [2025-03-04 01:04:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 443 transitions. [2025-03-04 01:04:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 443 transitions. [2025-03-04 01:04:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:04:29,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:29,552 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:29,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:04:29,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:29,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash -440768594, now seen corresponding path program 1 times [2025-03-04 01:04:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791522089] [2025-03-04 01:04:29,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:29,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:04:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791522089] [2025-03-04 01:04:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791522089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:29,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:29,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:04:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106640188] [2025-03-04 01:04:29,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:29,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:04:29,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:29,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:04:29,677 INFO L87 Difference]: Start difference. First operand 330 states and 443 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:29,750 INFO L93 Difference]: Finished difference Result 633 states and 833 transitions. [2025-03-04 01:04:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:29,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:04:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:29,752 INFO L225 Difference]: With dead ends: 633 [2025-03-04 01:04:29,752 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 01:04:29,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:29,753 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:29,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 379 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 01:04:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 306. [2025-03-04 01:04:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 264 states have (on average 1.2916666666666667) internal successors, (341), 265 states have internal predecessors, (341), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:04:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 403 transitions. [2025-03-04 01:04:29,781 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 403 transitions. Word has length 99 [2025-03-04 01:04:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:29,781 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 403 transitions. [2025-03-04 01:04:29,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 403 transitions. [2025-03-04 01:04:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:04:29,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:29,782 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:29,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:04:29,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1500137785, now seen corresponding path program 1 times [2025-03-04 01:04:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:04:29,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986748291] [2025-03-04 01:04:29,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:04:29,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:04:29,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:04:29,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:29,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:04:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712014875] [2025-03-04 01:04:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:29,851 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-04 01:04:29,854 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-04 01:04:29,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:04:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:04:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:04:30,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:04:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:04:30,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:04:30,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:30,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:04:30,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:04:30,154 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:04:30,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:04:30,164 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-04 01:04:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:04:30,359 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:30,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:04:30,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:04:30 BoogieIcfgContainer [2025-03-04 01:04:30,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:04:30,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:04:30,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:04:30,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:04:30,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:22" (3/4) ... [2025-03-04 01:04:30,427 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:04:30,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:04:30,428 INFO L158 Benchmark]: Toolchain (without parser) took 8875.49ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 110.1MB in the beginning and 241.9MB in the end (delta: -131.8MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,428 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:04:30,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 96.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.13ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:04:30,429 INFO L158 Benchmark]: Boogie Preprocessor took 46.97ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,429 INFO L158 Benchmark]: IcfgBuilder took 470.44ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 59.6MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,429 INFO L158 Benchmark]: TraceAbstraction took 8061.82ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 59.6MB in the beginning and 242.0MB in the end (delta: -182.4MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,429 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 377.5MB. Free memory was 242.0MB in the beginning and 241.9MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:04:30,431 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 96.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.13ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.97ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 470.44ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 59.6MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8061.82ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 59.6MB in the beginning and 242.0MB in the end (delta: -182.4MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 377.5MB. Free memory was 242.0MB in the beginning and 241.9MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR signed_long_int_Array_0[0][1] [L67] EXPR unsigned_char_Array_0[1] [L67] EXPR unsigned_char_Array_0[1] [L67] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR signed_long_int_Array_0[1][1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 6952 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5224 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1728 mSDtfsCounter, 1511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 519 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1242 ConstructedInterpolants, 0 QuantifiedInterpolants, 3896 SizeOfPredicates, 6 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2840/2860 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-04 01:04:30,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-a_file-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:04:32,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:04:32,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:04:32,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:04:32,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:04:32,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:04:32,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:04:32,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:04:32,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:04:32,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:04:32,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:04:32,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:04:32,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:04:32,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:04:32,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:04:32,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:04:32,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:04:32,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:04:32,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:04:32,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:04:32,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:04:32,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:04:32,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:04:32,414 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2025-03-04 01:04:32,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:04:32,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:04:32,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:04:32,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:04:32,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:04:32,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:33,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86500681e/513bd5f593d44128b4b22ad68aa85f40/FLAG21e5d88a0 [2025-03-04 01:04:34,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:04:34,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:34,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86500681e/513bd5f593d44128b4b22ad68aa85f40/FLAG21e5d88a0 [2025-03-04 01:04:34,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86500681e/513bd5f593d44128b4b22ad68aa85f40 [2025-03-04 01:04:34,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:04:34,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:04:34,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:04:34,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:04:34,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:04:34,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7e922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34, skipping insertion in model container [2025-03-04 01:04:34,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:04:34,189 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-a_file-31.i[916,929] [2025-03-04 01:04:34,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:04:34,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:04:34,263 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-a_file-31.i[916,929] [2025-03-04 01:04:34,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:04:34,314 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:04:34,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34 WrapperNode [2025-03-04 01:04:34,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:04:34,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:04:34,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:04:34,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:04:34,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,354 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2025-03-04 01:04:34,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:04:34,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:04:34,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:04:34,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:04:34,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,387 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-03-04 01:04:34,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:04:34,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:04:34,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:04:34,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:04:34,416 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (1/1) ... [2025-03-04 01:04:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:04:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:04:34,442 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-04 01:04:34,444 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-04 01:04:34,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:04:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:04:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:04:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:04:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:04:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:04:34,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:04:34,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:04:34,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-04 01:04:34,971 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-04 01:04:34,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:04:34,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:04:34,997 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:04:34,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:34 BoogieIcfgContainer [2025-03-04 01:04:34,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:04:34,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:04:34,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:04:35,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:04:35,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:04:34" (1/3) ... [2025-03-04 01:04:35,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b31e522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:35, skipping insertion in model container [2025-03-04 01:04:35,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:04:34" (2/3) ... [2025-03-04 01:04:35,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b31e522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:04:35, skipping insertion in model container [2025-03-04 01:04:35,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:04:34" (3/3) ... [2025-03-04 01:04:35,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2025-03-04 01:04:35,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:04:35,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:04:35,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:04:35,061 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;@613e1b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:04:35,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:04:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:35,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:35,073 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:35,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:35,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-03-04 01:04:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722480250] [2025-03-04 01:04:35,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:35,084 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-04 01:04:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:35,087 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-04 01:04:35,089 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-04 01:04:35,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:35,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:35,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:35,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:04:35,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 01:04:35,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:35,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722480250] [2025-03-04 01:04:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722480250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:04:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563579774] [2025-03-04 01:04:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:04:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:04:35,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:04:35,355 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:35,369 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-03-04 01:04:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:04:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:04:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:35,375 INFO L225 Difference]: With dead ends: 163 [2025-03-04 01:04:35,375 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 01:04:35,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-04 01:04:35,379 INFO L435 NwaCegarLoop]: 114 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, 114 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-04 01:04:35,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 01:04:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 01:04:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-04 01:04:35,412 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2025-03-04 01:04:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:35,413 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-04 01:04:35,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:04:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-04 01:04:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:35,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:35,416 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:35,423 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-04 01:04:35,617 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-04 01:04:35,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-03-04 01:04:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810195918] [2025-03-04 01:04:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:35,619 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-04 01:04:35,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:35,621 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-04 01:04:35,623 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-04 01:04:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:35,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:35,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:35,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:35,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:04:35,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:35,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:04:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:35,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:35,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810195918] [2025-03-04 01:04:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810195918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:35,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:35,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:04:35,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493286065] [2025-03-04 01:04:35,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:35,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:04:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:35,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:04:35,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:04:35,916 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:35,937 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-03-04 01:04:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:04:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:04:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:35,938 INFO L225 Difference]: With dead ends: 157 [2025-03-04 01:04:35,938 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 01:04:35,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-04 01:04:35,939 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 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-04 01:04:35,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 01:04:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 01:04:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:04:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-03-04 01:04:35,946 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2025-03-04 01:04:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:35,949 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-03-04 01:04:35,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-03-04 01:04:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:04:35,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:35,953 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:35,959 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-04 01:04:36,153 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-04 01:04:36,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-03-04 01:04:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241467014] [2025-03-04 01:04:36,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:36,155 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-04 01:04:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:36,157 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-04 01:04:36,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:04:36,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:04:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:04:36,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:36,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:36,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:04:36,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:36,477 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-04 01:04:36,573 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 40 treesize of output 33 [2025-03-04 01:04:36,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:36,650 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 68 treesize of output 58 [2025-03-04 01:04:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 01:04:36,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:36,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241467014] [2025-03-04 01:04:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241467014] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:36,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-04 01:04:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2610177] [2025-03-04 01:04:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:36,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:36,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:36,955 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:37,265 INFO L93 Difference]: Finished difference Result 214 states and 302 transitions. [2025-03-04 01:04:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:37,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:04:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:37,269 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:04:37,269 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:04:37,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:04:37,270 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:37,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 479 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:04:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-03-04 01:04:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 114 states have internal predecessors, (153), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2025-03-04 01:04:37,287 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 94 [2025-03-04 01:04:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:37,287 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2025-03-04 01:04:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2025-03-04 01:04:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:37,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:37,289 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:37,296 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-04 01:04:37,493 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-04 01:04:37,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-03-04 01:04:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285072488] [2025-03-04 01:04:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:37,496 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-04 01:04:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:37,498 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-04 01:04:37,499 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-04 01:04:37,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:37,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:37,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:37,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:37,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:04:37,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:37,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:04:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:37,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:37,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285072488] [2025-03-04 01:04:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285072488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:37,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:04:37,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247350181] [2025-03-04 01:04:37,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:37,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:04:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:37,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:04:37,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:04:37,698 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:37,719 INFO L93 Difference]: Finished difference Result 265 states and 375 transitions. [2025-03-04 01:04:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:04:37,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:04:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:37,723 INFO L225 Difference]: With dead ends: 265 [2025-03-04 01:04:37,723 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 01:04:37,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-04 01:04:37,724 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:37,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:04:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 01:04:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 01:04:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.336283185840708) internal successors, (151), 114 states have internal predecessors, (151), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2025-03-04 01:04:37,740 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 96 [2025-03-04 01:04:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:37,741 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2025-03-04 01:04:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2025-03-04 01:04:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:37,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:37,744 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:37,750 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-04 01:04:37,944 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-04 01:04:37,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:37,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-03-04 01:04:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30484162] [2025-03-04 01:04:37,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:37,945 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-04 01:04:37,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:37,949 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-04 01:04:37,950 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-04 01:04:38,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:38,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:38,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:38,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:38,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:04:38,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:38,187 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-04 01:04:38,260 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 40 treesize of output 33 [2025-03-04 01:04:38,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:38,327 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 68 treesize of output 58 [2025-03-04 01:04:38,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:38,704 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 152 treesize of output 98 [2025-03-04 01:04:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 01:04:38,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:38,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30484162] [2025-03-04 01:04:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30484162] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-03-04 01:04:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680502169] [2025-03-04 01:04:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:38,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:38,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:04:38,881 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:39,145 INFO L93 Difference]: Finished difference Result 294 states and 411 transitions. [2025-03-04 01:04:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:04:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:39,147 INFO L225 Difference]: With dead ends: 294 [2025-03-04 01:04:39,147 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 01:04:39,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:04:39,148 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 82 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:39,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 541 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:04:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 01:04:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2025-03-04 01:04:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2025-03-04 01:04:39,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 96 [2025-03-04 01:04:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:39,159 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2025-03-04 01:04:39,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2025-03-04 01:04:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:04:39,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:39,160 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:39,167 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-04 01:04:39,360 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-04 01:04:39,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:39,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-03-04 01:04:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:39,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317215780] [2025-03-04 01:04:39,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:39,362 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-04 01:04:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:39,365 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-04 01:04:39,365 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-04 01:04:39,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:04:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:04:39,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:39,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:39,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:04:39,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 01:04:39,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:39,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317215780] [2025-03-04 01:04:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317215780] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:04:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142986084] [2025-03-04 01:04:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:39,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:39,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:04:39,748 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:39,839 INFO L93 Difference]: Finished difference Result 241 states and 325 transitions. [2025-03-04 01:04:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:04:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:39,841 INFO L225 Difference]: With dead ends: 241 [2025-03-04 01:04:39,841 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 01:04:39,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:04:39,842 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 102 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:39,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 366 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 01:04:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-04 01:04:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 128 states have internal predecessors, (163), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:04:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 203 transitions. [2025-03-04 01:04:39,855 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 203 transitions. Word has length 96 [2025-03-04 01:04:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 203 transitions. [2025-03-04 01:04:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 203 transitions. [2025-03-04 01:04:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:04:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:39,856 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:39,862 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-04 01:04:40,056 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-04 01:04:40,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-03-04 01:04:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755795775] [2025-03-04 01:04:40,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:40,057 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-04 01:04:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:40,059 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-04 01:04:40,060 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-04 01:04:40,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:04:40,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:04:40,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:40,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:40,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:04:40,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:40,350 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 33 treesize of output 15 [2025-03-04 01:04:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 01:04:40,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:40,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755795775] [2025-03-04 01:04:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755795775] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:40,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-04 01:04:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546355876] [2025-03-04 01:04:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:40,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:04:40,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:40,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:04:40,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:04:40,467 INFO L87 Difference]: Start difference. First operand 151 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:40,557 INFO L93 Difference]: Finished difference Result 275 states and 364 transitions. [2025-03-04 01:04:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-04 01:04:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:40,559 INFO L225 Difference]: With dead ends: 275 [2025-03-04 01:04:40,559 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:04:40,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:04:40,560 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:40,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:04:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2025-03-04 01:04:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.263157894736842) internal successors, (120), 96 states have internal predecessors, (120), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:04:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-03-04 01:04:40,568 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 97 [2025-03-04 01:04:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-03-04 01:04:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-03-04 01:04:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:04:40,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:40,569 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:40,575 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-04 01:04:40,769 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-04 01:04:40,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:40,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-03-04 01:04:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696367838] [2025-03-04 01:04:40,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:40,770 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-04 01:04:40,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:40,772 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-04 01:04:40,773 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-04 01:04:40,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:04:40,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:04:40,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:40,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:04:40,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:40,985 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-04 01:04:40,991 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 19 treesize of output 19 [2025-03-04 01:04:41,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:41,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2025-03-04 01:04:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:41,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:04:41,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:41,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696367838] [2025-03-04 01:04:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696367838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:04:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:04:41,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:04:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339894216] [2025-03-04 01:04:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:41,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:04:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:41,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:04:41,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:04:41,049 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:41,218 INFO L93 Difference]: Finished difference Result 296 states and 390 transitions. [2025-03-04 01:04:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:04:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2025-03-04 01:04:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:41,219 INFO L225 Difference]: With dead ends: 296 [2025-03-04 01:04:41,219 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:04:41,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:04:41,221 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 87 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:41,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 655 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:04:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:04:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-03-04 01:04:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 169 states have internal predecessors, (213), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:04:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 267 transitions. [2025-03-04 01:04:41,239 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 267 transitions. Word has length 98 [2025-03-04 01:04:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:41,239 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 267 transitions. [2025-03-04 01:04:41,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 267 transitions. [2025-03-04 01:04:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:04:41,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:41,240 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:04:41,249 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-04 01:04:41,440 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-04 01:04:41,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:41,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-03-04 01:04:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688435137] [2025-03-04 01:04:41,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:41,441 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-04 01:04:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:41,443 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-04 01:04:41,445 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-04 01:04:41,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:04:41,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:04:41,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:04:41,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:04:41,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:04:41,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:04:41,677 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 9 treesize of output 3 [2025-03-04 01:04:41,873 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-04 01:04:42,021 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 23 treesize of output 22 [2025-03-04 01:04:42,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:42,355 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 56 treesize of output 46 [2025-03-04 01:04:42,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 86 [2025-03-04 01:04:42,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 118 [2025-03-04 01:04:42,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:04:42,922 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 133 treesize of output 77 [2025-03-04 01:04:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 9 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-04 01:04:42,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:04:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:04:44,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:04:44,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688435137] [2025-03-04 01:04:44,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688435137] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:04:44,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:04:44,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-03-04 01:04:44,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726899142] [2025-03-04 01:04:44,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:04:44,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:04:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:04:44,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:04:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:04:44,236 INFO L87 Difference]: Start difference. First operand 202 states and 267 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:04:49,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:04:53,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:04:57,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:05:01,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:05:05,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:05:09,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:05:13,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:05:17,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 01:05:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:18,014 INFO L93 Difference]: Finished difference Result 451 states and 595 transitions. [2025-03-04 01:05:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:05:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:18,019 INFO L225 Difference]: With dead ends: 451 [2025-03-04 01:05:18,019 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 01:05:18,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:05:18,020 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:18,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 502 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 8 Unknown, 0 Unchecked, 33.4s Time] [2025-03-04 01:05:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 01:05:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 224. [2025-03-04 01:05:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 191 states have internal predecessors, (242), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:05:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 296 transitions. [2025-03-04 01:05:18,036 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 296 transitions. Word has length 99 [2025-03-04 01:05:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 296 transitions. [2025-03-04 01:05:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 296 transitions. [2025-03-04 01:05:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:05:18,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:18,039 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:18,047 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-04 01:05:18,239 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-04 01:05:18,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1283544114, now seen corresponding path program 1 times [2025-03-04 01:05:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738739096] [2025-03-04 01:05:18,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:18,241 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-04 01:05:18,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:18,243 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-04 01:05:18,245 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-04 01:05:18,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:05:18,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:05:18,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:18,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:18,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:05:18,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:18,426 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-04 01:05:18,493 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 40 treesize of output 33 [2025-03-04 01:05:18,498 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 26 treesize of output 20 [2025-03-04 01:05:18,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:18,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2025-03-04 01:05:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 01:05:18,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:18,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738739096] [2025-03-04 01:05:18,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738739096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7528939] [2025-03-04 01:05:18,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:18,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:05:18,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:05:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:05:18,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:05:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:05:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:19,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:05:19,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:19,330 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 15 treesize of output 15 [2025-03-04 01:05:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:19,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [7528939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-04 01:05:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479072198] [2025-03-04 01:05:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:19,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:19,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:05:19,413 INFO L87 Difference]: Start difference. First operand 224 states and 296 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:19,730 INFO L93 Difference]: Finished difference Result 549 states and 722 transitions. [2025-03-04 01:05:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:05:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:05:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:19,732 INFO L225 Difference]: With dead ends: 549 [2025-03-04 01:05:19,733 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 01:05:19,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:05:19,733 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 129 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:19,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 649 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 01:05:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 235. [2025-03-04 01:05:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:05:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2025-03-04 01:05:19,747 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 99 [2025-03-04 01:05:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:19,748 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2025-03-04 01:05:19,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2025-03-04 01:05:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:05:19,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:19,749 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:05:19,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:05:20,149 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:20,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1794078291, now seen corresponding path program 1 times [2025-03-04 01:05:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644103142] [2025-03-04 01:05:20,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:20,151 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-04 01:05:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:20,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:05:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:05:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:05:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:05:20,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:20,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:05:20,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:20,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:20,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:20,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644103142] [2025-03-04 01:05:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644103142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:20,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377577576] [2025-03-04 01:05:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:20,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:20,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:20,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:05:20,346 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:20,585 INFO L93 Difference]: Finished difference Result 586 states and 771 transitions. [2025-03-04 01:05:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:05:20,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:05:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:20,588 INFO L225 Difference]: With dead ends: 586 [2025-03-04 01:05:20,588 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 01:05:20,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:20,590 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 69 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:20,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 01:05:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 226. [2025-03-04 01:05:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 200 states have internal predecessors, (259), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:05:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2025-03-04 01:05:20,610 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 99 [2025-03-04 01:05:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:20,611 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2025-03-04 01:05:20,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2025-03-04 01:05:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:05:20,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:20,612 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:20,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:05:20,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:05:20,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:20,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -440768594, now seen corresponding path program 1 times [2025-03-04 01:05:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021691929] [2025-03-04 01:05:20,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:20,813 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-04 01:05:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:20,815 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:05:20,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:05:20,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:05:20,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:05:20,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:20,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:05:20,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:21,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:21,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021691929] [2025-03-04 01:05:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021691929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146705783] [2025-03-04 01:05:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:21,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:21,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:05:21,005 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:21,102 INFO L93 Difference]: Finished difference Result 502 states and 652 transitions. [2025-03-04 01:05:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:05:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:21,104 INFO L225 Difference]: With dead ends: 502 [2025-03-04 01:05:21,104 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 01:05:21,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 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-04 01:05:21,105 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:21,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 472 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:05:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 01:05:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 208. [2025-03-04 01:05:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.2486187845303867) internal successors, (226), 182 states have internal predecessors, (226), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:05:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2025-03-04 01:05:21,118 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 99 [2025-03-04 01:05:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2025-03-04 01:05:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2025-03-04 01:05:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:05:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:21,119 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:21,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-04 01:05:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-04 01:05:21,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1500137785, now seen corresponding path program 1 times [2025-03-04 01:05:21,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:21,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388311760] [2025-03-04 01:05:21,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:21,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:05:21,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:21,326 INFO L229 MonitoredProcess]: Starting monitored process 15 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-04 01:05:21,326 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 (15)] Waiting until timeout for monitored process [2025-03-04 01:05:21,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:05:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:05:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:21,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:05:21,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 01:05:22,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:22,545 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 208 treesize of output 106 [2025-03-04 01:05:23,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:23,048 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 359 treesize of output 151 [2025-03-04 01:05:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 01:05:23,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:23,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388311760] [2025-03-04 01:05:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388311760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1570418662] [2025-03-04 01:05:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:05:23,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:05:23,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-04 01:05:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:05:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:05:24,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:24,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:24,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:05:24,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:24,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:05:25,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2025-03-04 01:05:25,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 151 [2025-03-04 01:05:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 01:05:25,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1570418662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:25,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:05:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-03-04 01:05:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93677876] [2025-03-04 01:05:25,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:05:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:05:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:05:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:05:25,965 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 01:05:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:28,431 INFO L93 Difference]: Finished difference Result 542 states and 684 transitions. [2025-03-04 01:05:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:05:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 100 [2025-03-04 01:05:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:28,434 INFO L225 Difference]: With dead ends: 542 [2025-03-04 01:05:28,434 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 01:05:28,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-03-04 01:05:28,434 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 554 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:28,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1014 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:05:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 01:05:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-03-04 01:05:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.23982869379015) internal successors, (579), 473 states have internal predecessors, (579), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:05:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 675 transitions. [2025-03-04 01:05:28,471 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 675 transitions. Word has length 100 [2025-03-04 01:05:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:28,471 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 675 transitions. [2025-03-04 01:05:28,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 01:05:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 675 transitions. [2025-03-04 01:05:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:05:28,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:28,472 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:28,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-03-04 01:05:28,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:05:28,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /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-04 01:05:28,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:28,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash 998966216, now seen corresponding path program 1 times [2025-03-04 01:05:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930851324] [2025-03-04 01:05:28,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:28,874 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-04 01:05:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:28,876 INFO L229 MonitoredProcess]: Starting monitored process 17 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-04 01:05:28,877 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 (17)] Waiting until timeout for monitored process [2025-03-04 01:05:28,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:05:29,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:05:29,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:29,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:29,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:05:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:29,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:29,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930851324] [2025-03-04 01:05:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930851324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:05:29,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596610083] [2025-03-04 01:05:29,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:29,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:05:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:29,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:05:29,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:29,066 INFO L87 Difference]: Start difference. First operand 532 states and 675 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:29,129 INFO L93 Difference]: Finished difference Result 1070 states and 1359 transitions. [2025-03-04 01:05:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:05:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-03-04 01:05:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:29,133 INFO L225 Difference]: With dead ends: 1070 [2025-03-04 01:05:29,133 INFO L226 Difference]: Without dead ends: 541 [2025-03-04 01:05:29,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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-04 01:05:29,134 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:29,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-04 01:05:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 532. [2025-03-04 01:05:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2334047109207709) internal successors, (576), 473 states have internal predecessors, (576), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:05:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 672 transitions. [2025-03-04 01:05:29,169 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 672 transitions. Word has length 100 [2025-03-04 01:05:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:29,171 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 672 transitions. [2025-03-04 01:05:29,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 672 transitions. [2025-03-04 01:05:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:05:29,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:29,172 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:29,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2025-03-04 01:05:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-04 01:05:29,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1016462458, now seen corresponding path program 1 times [2025-03-04 01:05:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533934944] [2025-03-04 01:05:29,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:29,374 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-04 01:05:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:29,375 INFO L229 MonitoredProcess]: Starting monitored process 18 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-04 01:05:29,376 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 (18)] Waiting until timeout for monitored process [2025-03-04 01:05:29,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:05:29,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:05:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:29,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:05:29,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 01:05:29,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:29,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533934944] [2025-03-04 01:05:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533934944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:05:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280899489] [2025-03-04 01:05:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:05:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:05:29,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:05:29,549 INFO L87 Difference]: Start difference. First operand 532 states and 672 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:05:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:29,619 INFO L93 Difference]: Finished difference Result 1061 states and 1341 transitions. [2025-03-04 01:05:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:05:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-04 01:05:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:29,621 INFO L225 Difference]: With dead ends: 1061 [2025-03-04 01:05:29,622 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 01:05:29,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-04 01:05:29,623 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 01:05:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-04 01:05:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2291220556745182) internal successors, (574), 473 states have internal predecessors, (574), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:05:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 670 transitions. [2025-03-04 01:05:29,654 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 670 transitions. Word has length 100 [2025-03-04 01:05:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:29,654 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 670 transitions. [2025-03-04 01:05:29,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:05:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 670 transitions. [2025-03-04 01:05:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:05:29,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:29,655 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:29,663 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 (18)] Ended with exit code 0 [2025-03-04 01:05:29,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-04 01:05:29,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:29,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1588269928, now seen corresponding path program 1 times [2025-03-04 01:05:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:29,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203333196] [2025-03-04 01:05:29,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:29,856 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-04 01:05:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:29,858 INFO L229 MonitoredProcess]: Starting monitored process 19 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-04 01:05:29,859 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 (19)] Waiting until timeout for monitored process [2025-03-04 01:05:29,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:05:30,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:05:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:30,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:05:30,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:30,082 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 9 treesize of output 3 [2025-03-04 01:05:30,134 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-04 01:05:30,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:30,307 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 56 treesize of output 46 [2025-03-04 01:05:30,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:30,423 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 84 treesize of output 71 [2025-03-04 01:05:30,427 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 119 treesize of output 89 [2025-03-04 01:05:30,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:30,794 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 105 treesize of output 55 [2025-03-04 01:05:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 01:05:30,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:31,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203333196] [2025-03-04 01:05:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203333196] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-04 01:05:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998975534] [2025-03-04 01:05:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:31,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:31,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:05:31,499 INFO L87 Difference]: Start difference. First operand 532 states and 670 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:35,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:05:40,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:05:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:40,466 INFO L93 Difference]: Finished difference Result 1145 states and 1438 transitions. [2025-03-04 01:05:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:05:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-04 01:05:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:40,472 INFO L225 Difference]: With dead ends: 1145 [2025-03-04 01:05:40,472 INFO L226 Difference]: Without dead ends: 616 [2025-03-04 01:05:40,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:05:40,474 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 40 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:40,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 459 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-03-04 01:05:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-04 01:05:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 515. [2025-03-04 01:05:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.22) internal successors, (549), 456 states have internal predecessors, (549), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:05:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 645 transitions. [2025-03-04 01:05:40,507 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 645 transitions. Word has length 101 [2025-03-04 01:05:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:40,508 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 645 transitions. [2025-03-04 01:05:40,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 645 transitions. [2025-03-04 01:05:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:05:40,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:40,509 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:40,517 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 (19)] Ended with exit code 0 [2025-03-04 01:05:40,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-04 01:05:40,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:40,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -507597641, now seen corresponding path program 1 times [2025-03-04 01:05:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:40,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724108109] [2025-03-04 01:05:40,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:40,710 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-04 01:05:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:40,712 INFO L229 MonitoredProcess]: Starting monitored process 20 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-04 01:05:40,713 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 (20)] Waiting until timeout for monitored process [2025-03-04 01:05:40,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:05:40,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:05:40,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:40,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:05:40,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:40,995 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 30 treesize of output 1 [2025-03-04 01:05:41,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:41,441 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 186 treesize of output 96 [2025-03-04 01:05:41,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:41,740 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 382 treesize of output 132 [2025-03-04 01:05:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 01:05:41,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:42,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724108109] [2025-03-04 01:05:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724108109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1654129906] [2025-03-04 01:05:42,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:42,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:05:42,683 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:05:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-03-04 01:05:42,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:05:43,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:05:43,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:43,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:43,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:05:43,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-04 01:05:48,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:48,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 94 [2025-03-04 01:05:49,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:49,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 316 treesize of output 136 [2025-03-04 01:05:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 01:05:49,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:05:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1654129906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:49,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:05:49,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-03-04 01:05:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208151209] [2025-03-04 01:05:49,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:05:49,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:05:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:49,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:05:49,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=756, Unknown=1, NotChecked=0, Total=870 [2025-03-04 01:05:49,447 INFO L87 Difference]: Start difference. First operand 515 states and 645 transitions. Second operand has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 01:05:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:52,606 INFO L93 Difference]: Finished difference Result 869 states and 1073 transitions. [2025-03-04 01:05:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:05:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 102 [2025-03-04 01:05:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:52,611 INFO L225 Difference]: With dead ends: 869 [2025-03-04 01:05:52,611 INFO L226 Difference]: Without dead ends: 867 [2025-03-04 01:05:52,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=394, Invalid=1861, Unknown=1, NotChecked=0, Total=2256 [2025-03-04 01:05:52,612 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 561 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:52,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1217 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:05:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-04 01:05:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 703. [2025-03-04 01:05:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 610 states have (on average 1.2180327868852459) internal successors, (743), 619 states have internal predecessors, (743), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:05:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 879 transitions. [2025-03-04 01:05:52,664 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 879 transitions. Word has length 102 [2025-03-04 01:05:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 879 transitions. [2025-03-04 01:05:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 01:05:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 879 transitions. [2025-03-04 01:05:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:05:52,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:52,666 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:52,675 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 (20)] Ended with exit code 0 [2025-03-04 01:05:52,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-03-04 01:05:53,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:53,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:53,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash 446631254, now seen corresponding path program 1 times [2025-03-04 01:05:53,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:53,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216274447] [2025-03-04 01:05:53,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:53,067 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-04 01:05:53,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:53,070 INFO L229 MonitoredProcess]: Starting monitored process 22 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-04 01:05:53,071 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 (22)] Waiting until timeout for monitored process [2025-03-04 01:05:53,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:05:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:05:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:53,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:05:53,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:05:53,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:53,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216274447] [2025-03-04 01:05:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216274447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:05:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080381077] [2025-03-04 01:05:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:05:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:05:53,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:53,275 INFO L87 Difference]: Start difference. First operand 703 states and 879 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:05:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:53,424 INFO L93 Difference]: Finished difference Result 1263 states and 1567 transitions. [2025-03-04 01:05:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:53,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-03-04 01:05:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:53,430 INFO L225 Difference]: With dead ends: 1263 [2025-03-04 01:05:53,430 INFO L226 Difference]: Without dead ends: 551 [2025-03-04 01:05:53,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:53,432 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:53,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:05:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-04 01:05:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 523. [2025-03-04 01:05:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 456 states have (on average 1.212719298245614) internal successors, (553), 462 states have internal predecessors, (553), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:05:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2025-03-04 01:05:53,467 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 102 [2025-03-04 01:05:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2025-03-04 01:05:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:05:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2025-03-04 01:05:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:05:53,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:53,468 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:53,480 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 (22)] Ended with exit code 0 [2025-03-04 01:05:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-04 01:05:53,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2140942666, now seen corresponding path program 1 times [2025-03-04 01:05:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640394525] [2025-03-04 01:05:53,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:53,674 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-04 01:05:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:53,676 INFO L229 MonitoredProcess]: Starting monitored process 23 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-04 01:05:53,679 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 (23)] Waiting until timeout for monitored process [2025-03-04 01:05:53,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:05:53,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:05:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:53,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:53,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:05:53,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:53,962 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 60 treesize of output 53 [2025-03-04 01:05:54,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2025-03-04 01:05:54,244 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 42 treesize of output 18 [2025-03-04 01:05:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:54,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:54,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640394525] [2025-03-04 01:05:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640394525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:05:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147510248] [2025-03-04 01:05:54,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:54,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:05:54,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:54,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:05:54,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:54,280 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:55,071 INFO L93 Difference]: Finished difference Result 1542 states and 1893 transitions. [2025-03-04 01:05:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:05:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:05:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:55,074 INFO L225 Difference]: With dead ends: 1542 [2025-03-04 01:05:55,074 INFO L226 Difference]: Without dead ends: 1022 [2025-03-04 01:05:55,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:05:55,076 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 163 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:55,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 683 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:05:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-03-04 01:05:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 726. [2025-03-04 01:05:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 624 states have (on average 1.1923076923076923) internal successors, (744), 635 states have internal predecessors, (744), 72 states have call successors, (72), 29 states have call predecessors, (72), 29 states have return successors, (72), 61 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 01:05:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 888 transitions. [2025-03-04 01:05:55,146 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 888 transitions. Word has length 103 [2025-03-04 01:05:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:55,146 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 888 transitions. [2025-03-04 01:05:55,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:05:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 888 transitions. [2025-03-04 01:05:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:05:55,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:55,147 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:05:55,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2025-03-04 01:05:55,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-04 01:05:55,348 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:55,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 363732621, now seen corresponding path program 1 times [2025-03-04 01:05:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887954023] [2025-03-04 01:05:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:55,349 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-04 01:05:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:55,351 INFO L229 MonitoredProcess]: Starting monitored process 24 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-04 01:05:55,352 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 (24)] Waiting until timeout for monitored process [2025-03-04 01:05:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:05:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:05:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:55,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:05:55,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:55,632 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 61 treesize of output 54 [2025-03-04 01:05:56,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:56,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2025-03-04 01:05:56,220 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 43 treesize of output 19 [2025-03-04 01:05:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:05:56,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:56,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887954023] [2025-03-04 01:05:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887954023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:05:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338771501] [2025-03-04 01:05:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:05:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:56,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:05:56,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:56,258 INFO L87 Difference]: Start difference. First operand 726 states and 888 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)