./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.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-56.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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:07:32,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:07:32,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:07:32,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:07:32,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:07:32,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:07:32,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:07:32,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:07:32,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:07:32,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:07:32,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:07:32,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:07:32,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:07:32,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:07:32,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:07:32,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:07:32,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:07:32,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:07:32,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:07:32,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:07:32,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:07:32,886 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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2025-03-04 01:07:33,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:07:33,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:07:33,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:07:33,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:07:33,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:07:33,134 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-56.i [2025-03-04 01:07:34,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a085653/49ab57e0cd404ec0bcd7e1c2c8a97e3f/FLAG0bbc93b5f [2025-03-04 01:07:34,513 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:07:34,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2025-03-04 01:07:34,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a085653/49ab57e0cd404ec0bcd7e1c2c8a97e3f/FLAG0bbc93b5f [2025-03-04 01:07:34,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a085653/49ab57e0cd404ec0bcd7e1c2c8a97e3f [2025-03-04 01:07:34,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:07:34,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:07:34,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:07:34,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:07:34,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:07:34,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66636642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34, skipping insertion in model container [2025-03-04 01:07:34,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:07:34,655 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-56.i[916,929] [2025-03-04 01:07:34,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:07:34,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:07:34,729 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-56.i[916,929] [2025-03-04 01:07:34,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:07:34,769 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:07:34,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34 WrapperNode [2025-03-04 01:07:34,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:07:34,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:07:34,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:07:34,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:07:34,775 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:07:34" (1/1) ... [2025-03-04 01:07:34,787 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:07:34" (1/1) ... [2025-03-04 01:07:34,821 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 572 [2025-03-04 01:07:34,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:07:34,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:07:34,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:07:34,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:07:34,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,857 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-03-04 01:07:34,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:07:34,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:07:34,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:07:34,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:07:34,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (1/1) ... [2025-03-04 01:07:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:07:34,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:07:34,911 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:07:34,914 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:07:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:07:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:07:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:07:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:07:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:07:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:07:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:07:35,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:07:35,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:07:35,527 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem90#1;havoc property_#t~bitwise91#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1;havoc property_#t~ite157#1;havoc property_#t~mem145#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~bitwise144#1;havoc property_#t~ite154#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~short158#1; [2025-03-04 01:07:35,577 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-04 01:07:35,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:07:35,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:07:35,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:07:35,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:07:35 BoogieIcfgContainer [2025-03-04 01:07:35,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:07:35,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:07:35,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:07:35,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:07:35,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:07:34" (1/3) ... [2025-03-04 01:07:35,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a17f769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:07:35, skipping insertion in model container [2025-03-04 01:07:35,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:07:34" (2/3) ... [2025-03-04 01:07:35,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a17f769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:07:35, skipping insertion in model container [2025-03-04 01:07:35,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:07:35" (3/3) ... [2025-03-04 01:07:35,604 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2025-03-04 01:07:35,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:07:35,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:07:35,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:07:35,675 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;@5152530c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:07:35,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:07:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:07:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:07:35,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:35,692 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:35,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1763959411, now seen corresponding path program 1 times [2025-03-04 01:07:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741570158] [2025-03-04 01:07:35,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:35,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:07:35,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:07:35,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:35,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:07:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741570158] [2025-03-04 01:07:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741570158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:07:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623127422] [2025-03-04 01:07:35,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:07:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:07:35,997 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:07:35,999 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:07:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:07:36,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:07:36,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:36,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:36,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:07:36,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:07:36,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623127422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:07:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:07:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623380118] [2025-03-04 01:07:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:07:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:07:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:07:36,245 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:07:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:36,279 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-03-04 01:07:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:07:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-04 01:07:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:36,288 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:07:36,289 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:07:36,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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:07:36,293 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 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:07:36,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:07:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:07:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:07:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-04 01:07:36,328 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-03-04 01:07:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-04 01:07:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:07:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-04 01:07:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:07:36,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:36,334 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:36,341 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:07:36,536 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:07:36,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:36,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 496223824, now seen corresponding path program 1 times [2025-03-04 01:07:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:36,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-04 01:07:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:36,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:07:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:07:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:36,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:36,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-04 01:07:36,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68481097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:07:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202466443] [2025-03-04 01:07:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:36,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:07:36,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:07:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:07:36,755 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:36,787 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2025-03-04 01:07:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:07:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:07:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:36,789 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:07:36,789 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:07:36,790 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:07:36,790 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:36,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:07:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-04 01:07:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:07:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-03-04 01:07:36,802 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2025-03-04 01:07:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:36,805 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-03-04 01:07:36,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-03-04 01:07:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:07:36,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:36,806 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:07:36,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:36,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash 905048049, now seen corresponding path program 1 times [2025-03-04 01:07:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677881710] [2025-03-04 01:07:36,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:07:36,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:07:36,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:36,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677881710] [2025-03-04 01:07:38,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677881710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:38,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:38,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:07:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474333523] [2025-03-04 01:07:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:07:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:07:38,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:07:38,111 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:38,473 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2025-03-04 01:07:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:07:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:07:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:38,477 INFO L225 Difference]: With dead ends: 334 [2025-03-04 01:07:38,479 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:07:38,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:07:38,480 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 126 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:38,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1334 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:07:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:07:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2025-03-04 01:07:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 180 states have (on average 1.4166666666666667) internal successors, (255), 181 states have internal predecessors, (255), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:07:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-03-04 01:07:38,504 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 151 [2025-03-04 01:07:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:38,505 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-03-04 01:07:38,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-03-04 01:07:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:07:38,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:38,507 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:07:38,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:38,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash 80120583, now seen corresponding path program 1 times [2025-03-04 01:07:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-03-04 01:07:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:38,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:07:38,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:07:38,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:38,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-03-04 01:07:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359836541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:07:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707072265] [2025-03-04 01:07:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:07:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:07:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:07:38,626 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:38,660 INFO L93 Difference]: Finished difference Result 420 states and 621 transitions. [2025-03-04 01:07:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:07:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:07:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:38,663 INFO L225 Difference]: With dead ends: 420 [2025-03-04 01:07:38,663 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 01:07:38,664 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:07:38,665 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 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:07:38,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 01:07:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 01:07:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 182 states have internal predecessors, (256), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:07:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2025-03-04 01:07:38,684 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 152 [2025-03-04 01:07:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:38,684 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2025-03-04 01:07:38,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2025-03-04 01:07:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:07:38,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:38,686 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:07:38,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1990617186, now seen corresponding path program 1 times [2025-03-04 01:07:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213459056] [2025-03-04 01:07:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:38,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:07:38,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:07:38,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:38,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213459056] [2025-03-04 01:07:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213459056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:38,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:07:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296716999] [2025-03-04 01:07:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:38,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:07:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:38,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:07:38,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:07:38,806 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:38,839 INFO L93 Difference]: Finished difference Result 423 states and 625 transitions. [2025-03-04 01:07:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:07:38,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:07:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:38,841 INFO L225 Difference]: With dead ends: 423 [2025-03-04 01:07:38,842 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:07:38,843 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:07:38,844 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:38,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:07:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 01:07:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 184 states have internal predecessors, (258), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:07:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 314 transitions. [2025-03-04 01:07:38,863 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 314 transitions. Word has length 152 [2025-03-04 01:07:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 314 transitions. [2025-03-04 01:07:38,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 314 transitions. [2025-03-04 01:07:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:38,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:38,866 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:07:38,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1619104710, now seen corresponding path program 1 times [2025-03-04 01:07:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-03-04 01:07:38,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:38,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:38,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:38,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:07:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-03-04 01:07:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519868294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:07:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784827937] [2025-03-04 01:07:39,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:07:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:07:39,097 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:07:39,100 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:07:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:39,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:39,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:39,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:39,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:07:39,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:39,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784827937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:39,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:07:39,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:07:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102123403] [2025-03-04 01:07:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:39,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:39,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:39,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:07:39,310 INFO L87 Difference]: Start difference. First operand 214 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:39,352 INFO L93 Difference]: Finished difference Result 431 states and 633 transitions. [2025-03-04 01:07:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:39,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:07:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:39,354 INFO L225 Difference]: With dead ends: 431 [2025-03-04 01:07:39,354 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 01:07:39,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:07:39,356 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:39,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 01:07:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-04 01:07:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 190 states have internal predecessors, (264), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:07:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 320 transitions. [2025-03-04 01:07:39,364 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 320 transitions. Word has length 153 [2025-03-04 01:07:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:39,364 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 320 transitions. [2025-03-04 01:07:39,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 320 transitions. [2025-03-04 01:07:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:39,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:39,366 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:39,376 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:07:39,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 01:07:39,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:39,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1498832270, now seen corresponding path program 1 times [2025-03-04 01:07:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284309595] [2025-03-04 01:07:39,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:39,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:39,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284309595] [2025-03-04 01:07:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284309595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:41,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:41,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:07:41,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365574852] [2025-03-04 01:07:41,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:41,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:07:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:41,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:07:41,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:07:41,400 INFO L87 Difference]: Start difference. First operand 220 states and 320 transitions. Second operand has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:43,066 INFO L93 Difference]: Finished difference Result 1278 states and 1866 transitions. [2025-03-04 01:07:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:07:43,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:07:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:43,076 INFO L225 Difference]: With dead ends: 1278 [2025-03-04 01:07:43,078 INFO L226 Difference]: Without dead ends: 1061 [2025-03-04 01:07:43,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:07:43,081 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 795 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:43,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1868 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:07:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-04 01:07:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 506. [2025-03-04 01:07:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 445 states have (on average 1.4337078651685393) internal successors, (638), 447 states have internal predecessors, (638), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:07:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 750 transitions. [2025-03-04 01:07:43,137 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 750 transitions. Word has length 153 [2025-03-04 01:07:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 750 transitions. [2025-03-04 01:07:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 750 transitions. [2025-03-04 01:07:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:43,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:43,141 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:07:43,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1288583217, now seen corresponding path program 1 times [2025-03-04 01:07:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-03-04 01:07:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:43,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:43,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:43,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:43,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-03-04 01:07:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086443332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:07:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041323255] [2025-03-04 01:07:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:43,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:43,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:07:43,419 INFO L87 Difference]: Start difference. First operand 506 states and 750 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:43,618 INFO L93 Difference]: Finished difference Result 1288 states and 1892 transitions. [2025-03-04 01:07:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:07:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:43,623 INFO L225 Difference]: With dead ends: 1288 [2025-03-04 01:07:43,624 INFO L226 Difference]: Without dead ends: 785 [2025-03-04 01:07:43,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:07:43,625 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 98 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:43,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 764 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:07:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-04 01:07:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 781. [2025-03-04 01:07:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 672 states have (on average 1.3958333333333333) internal successors, (938), 678 states have internal predecessors, (938), 100 states have call successors, (100), 8 states have call predecessors, (100), 8 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:07:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1138 transitions. [2025-03-04 01:07:43,687 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1138 transitions. Word has length 153 [2025-03-04 01:07:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:43,687 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1138 transitions. [2025-03-04 01:07:43,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1138 transitions. [2025-03-04 01:07:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:43,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:43,690 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:07:43,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1581986224, now seen corresponding path program 1 times [2025-03-04 01:07:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422245822] [2025-03-04 01:07:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:43,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:43,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:43,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422245822] [2025-03-04 01:07:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422245822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:07:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468652908] [2025-03-04 01:07:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:07:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:44,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:07:44,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:07:44,465 INFO L87 Difference]: Start difference. First operand 781 states and 1138 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:44,787 INFO L93 Difference]: Finished difference Result 1972 states and 2880 transitions. [2025-03-04 01:07:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:07:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:07:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:44,792 INFO L225 Difference]: With dead ends: 1972 [2025-03-04 01:07:44,793 INFO L226 Difference]: Without dead ends: 1194 [2025-03-04 01:07:44,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:07:44,794 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 133 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:44,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 715 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:07:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-03-04 01:07:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 924. [2025-03-04 01:07:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 815 states have (on average 1.4245398773006135) internal successors, (1161), 821 states have internal predecessors, (1161), 100 states have call successors, (100), 8 states have call predecessors, (100), 8 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:07:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1361 transitions. [2025-03-04 01:07:44,851 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1361 transitions. Word has length 153 [2025-03-04 01:07:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:44,852 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1361 transitions. [2025-03-04 01:07:44,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1361 transitions. [2025-03-04 01:07:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:44,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:44,855 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:44,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:07:44,855 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1304914820, now seen corresponding path program 1 times [2025-03-04 01:07:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562710425] [2025-03-04 01:07:44,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:44,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:44,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562710425] [2025-03-04 01:07:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562710425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:07:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532154235] [2025-03-04 01:07:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:44,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:44,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:07:44,958 INFO L87 Difference]: Start difference. First operand 924 states and 1361 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:45,058 INFO L93 Difference]: Finished difference Result 2179 states and 3209 transitions. [2025-03-04 01:07:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:07:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:45,065 INFO L225 Difference]: With dead ends: 2179 [2025-03-04 01:07:45,066 INFO L226 Difference]: Without dead ends: 1258 [2025-03-04 01:07:45,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:07:45,068 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 78 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:45,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 637 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-04 01:07:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1013. [2025-03-04 01:07:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 904 states have (on average 1.4347345132743363) internal successors, (1297), 910 states have internal predecessors, (1297), 100 states have call successors, (100), 8 states have call predecessors, (100), 8 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:07:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1497 transitions. [2025-03-04 01:07:45,129 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1497 transitions. Word has length 153 [2025-03-04 01:07:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:45,130 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1497 transitions. [2025-03-04 01:07:45,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1497 transitions. [2025-03-04 01:07:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:45,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:45,132 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:07:45,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:45,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1457792564, now seen corresponding path program 1 times [2025-03-04 01:07:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635381547] [2025-03-04 01:07:45,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:45,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:45,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:45,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635381547] [2025-03-04 01:07:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635381547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:46,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:46,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:07:46,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377791030] [2025-03-04 01:07:46,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:46,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:07:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:46,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:07:46,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:07:46,316 INFO L87 Difference]: Start difference. First operand 1013 states and 1497 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:07:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:47,039 INFO L93 Difference]: Finished difference Result 2211 states and 3254 transitions. [2025-03-04 01:07:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:07:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-04 01:07:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:47,044 INFO L225 Difference]: With dead ends: 2211 [2025-03-04 01:07:47,044 INFO L226 Difference]: Without dead ends: 1201 [2025-03-04 01:07:47,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:07:47,047 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 116 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:47,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2007 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:07:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-04 01:07:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1000. [2025-03-04 01:07:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 891 states have (on average 1.430976430976431) internal successors, (1275), 897 states have internal predecessors, (1275), 100 states have call successors, (100), 8 states have call predecessors, (100), 8 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 01:07:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1475 transitions. [2025-03-04 01:07:47,103 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1475 transitions. Word has length 153 [2025-03-04 01:07:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:47,103 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1475 transitions. [2025-03-04 01:07:47,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:07:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1475 transitions. [2025-03-04 01:07:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:47,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:47,105 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:07:47,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1244095725, now seen corresponding path program 1 times [2025-03-04 01:07:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938934974] [2025-03-04 01:07:47,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:47,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:47,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:47,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938934974] [2025-03-04 01:07:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938934974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:07:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417501503] [2025-03-04 01:07:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:47,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:07:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:47,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:07:47,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:07:47,661 INFO L87 Difference]: Start difference. First operand 1000 states and 1475 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:48,013 INFO L93 Difference]: Finished difference Result 2440 states and 3582 transitions. [2025-03-04 01:07:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:07:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:07:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:48,020 INFO L225 Difference]: With dead ends: 2440 [2025-03-04 01:07:48,020 INFO L226 Difference]: Without dead ends: 1443 [2025-03-04 01:07:48,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:07:48,023 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 130 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:48,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1194 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:07:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-04 01:07:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 909. [2025-03-04 01:07:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 820 states have (on average 1.446341463414634) internal successors, (1186), 824 states have internal predecessors, (1186), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:07:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1350 transitions. [2025-03-04 01:07:48,080 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1350 transitions. Word has length 153 [2025-03-04 01:07:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1350 transitions. [2025-03-04 01:07:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1350 transitions. [2025-03-04 01:07:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:48,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:48,084 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:48,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:07:48,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1836722769, now seen corresponding path program 1 times [2025-03-04 01:07:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448982592] [2025-03-04 01:07:48,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:48,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448982592] [2025-03-04 01:07:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448982592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:07:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510708440] [2025-03-04 01:07:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:48,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:07:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:48,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:07:48,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:07:48,774 INFO L87 Difference]: Start difference. First operand 909 states and 1350 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:49,313 INFO L93 Difference]: Finished difference Result 1950 states and 2885 transitions. [2025-03-04 01:07:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:07:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:07:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:49,318 INFO L225 Difference]: With dead ends: 1950 [2025-03-04 01:07:49,318 INFO L226 Difference]: Without dead ends: 1044 [2025-03-04 01:07:49,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:07:49,320 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 114 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:49,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1517 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:07:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-03-04 01:07:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 906. [2025-03-04 01:07:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 817 states have (on average 1.4455324357405142) internal successors, (1181), 821 states have internal predecessors, (1181), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:07:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1345 transitions. [2025-03-04 01:07:49,363 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1345 transitions. Word has length 153 [2025-03-04 01:07:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:49,363 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1345 transitions. [2025-03-04 01:07:49,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1345 transitions. [2025-03-04 01:07:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:49,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:49,365 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:49,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:07:49,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 909653012, now seen corresponding path program 1 times [2025-03-04 01:07:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441203083] [2025-03-04 01:07:49,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:49,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:49,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:49,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:49,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441203083] [2025-03-04 01:07:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441203083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:49,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:07:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203691586] [2025-03-04 01:07:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:49,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:07:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:49,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:07:49,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:07:49,700 INFO L87 Difference]: Start difference. First operand 906 states and 1345 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:07:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:49,982 INFO L93 Difference]: Finished difference Result 2091 states and 3082 transitions. [2025-03-04 01:07:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:07:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:07:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:49,987 INFO L225 Difference]: With dead ends: 2091 [2025-03-04 01:07:49,987 INFO L226 Difference]: Without dead ends: 1188 [2025-03-04 01:07:49,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:07:49,989 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 138 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:49,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1022 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:07:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-04 01:07:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 906. [2025-03-04 01:07:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 817 states have (on average 1.4406364749082008) internal successors, (1177), 821 states have internal predecessors, (1177), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:07:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1341 transitions. [2025-03-04 01:07:50,033 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1341 transitions. Word has length 153 [2025-03-04 01:07:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:50,033 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1341 transitions. [2025-03-04 01:07:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:07:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1341 transitions. [2025-03-04 01:07:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:50,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:50,035 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:07:50,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 940672819, now seen corresponding path program 1 times [2025-03-04 01:07:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608691283] [2025-03-04 01:07:50,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:50,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608691283] [2025-03-04 01:07:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608691283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:07:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312883516] [2025-03-04 01:07:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:50,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:07:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:50,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:07:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:07:50,749 INFO L87 Difference]: Start difference. First operand 906 states and 1341 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:51,291 INFO L93 Difference]: Finished difference Result 2000 states and 2946 transitions. [2025-03-04 01:07:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:07:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:07:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:51,296 INFO L225 Difference]: With dead ends: 2000 [2025-03-04 01:07:51,296 INFO L226 Difference]: Without dead ends: 1097 [2025-03-04 01:07:51,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:07:51,299 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 114 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:51,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1845 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:07:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-03-04 01:07:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 898. [2025-03-04 01:07:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 809 states have (on average 1.4388133498145859) internal successors, (1164), 813 states have internal predecessors, (1164), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:07:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1328 transitions. [2025-03-04 01:07:51,338 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1328 transitions. Word has length 153 [2025-03-04 01:07:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1328 transitions. [2025-03-04 01:07:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:07:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1328 transitions. [2025-03-04 01:07:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:07:51,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:51,341 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:07:51,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:51,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -866809778, now seen corresponding path program 1 times [2025-03-04 01:07:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734954771] [2025-03-04 01:07:51,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:51,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:07:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:07:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734954771] [2025-03-04 01:07:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734954771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:07:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035397238] [2025-03-04 01:07:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:07:51,421 INFO L87 Difference]: Start difference. First operand 898 states and 1328 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:51,505 INFO L93 Difference]: Finished difference Result 1884 states and 2774 transitions. [2025-03-04 01:07:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:07:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:51,510 INFO L225 Difference]: With dead ends: 1884 [2025-03-04 01:07:51,510 INFO L226 Difference]: Without dead ends: 989 [2025-03-04 01:07:51,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:07:51,512 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 90 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:51,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 796 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-04 01:07:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 895. [2025-03-04 01:07:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 806 states have (on average 1.4280397022332507) internal successors, (1151), 810 states have internal predecessors, (1151), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:07:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1315 transitions. [2025-03-04 01:07:51,552 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1315 transitions. Word has length 153 [2025-03-04 01:07:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:51,552 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1315 transitions. [2025-03-04 01:07:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1315 transitions. [2025-03-04 01:07:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:07:51,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:51,555 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:07:51,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:51,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1258130478, now seen corresponding path program 1 times [2025-03-04 01:07:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464561400] [2025-03-04 01:07:51,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:51,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:07:51,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:07:51,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:51,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464561400] [2025-03-04 01:07:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464561400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:07:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61369243] [2025-03-04 01:07:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:07:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:51,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:07:51,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:07:51,597 INFO L87 Difference]: Start difference. First operand 895 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:51,635 INFO L93 Difference]: Finished difference Result 1657 states and 2436 transitions. [2025-03-04 01:07:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:07:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-04 01:07:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:51,639 INFO L225 Difference]: With dead ends: 1657 [2025-03-04 01:07:51,639 INFO L226 Difference]: Without dead ends: 765 [2025-03-04 01:07:51,640 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:07:51,641 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:51,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-04 01:07:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 643. [2025-03-04 01:07:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 572 states have (on average 1.4055944055944056) internal successors, (804), 574 states have internal predecessors, (804), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:07:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 932 transitions. [2025-03-04 01:07:51,670 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 932 transitions. Word has length 154 [2025-03-04 01:07:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 932 transitions. [2025-03-04 01:07:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 932 transitions. [2025-03-04 01:07:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:07:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:51,671 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:07:51,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2014844701, now seen corresponding path program 1 times [2025-03-04 01:07:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446339005] [2025-03-04 01:07:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:07:51,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:07:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446339005] [2025-03-04 01:07:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446339005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:51,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:51,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:07:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021203781] [2025-03-04 01:07:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:07:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:51,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:07:51,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:07:51,717 INFO L87 Difference]: Start difference. First operand 643 states and 932 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:51,751 INFO L93 Difference]: Finished difference Result 1223 states and 1769 transitions. [2025-03-04 01:07:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:07:51,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-04 01:07:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:51,755 INFO L225 Difference]: With dead ends: 1223 [2025-03-04 01:07:51,756 INFO L226 Difference]: Without dead ends: 583 [2025-03-04 01:07:51,757 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:07:51,758 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 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:07:51,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-04 01:07:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-04 01:07:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 512 states have (on average 1.38671875) internal successors, (710), 514 states have internal predecessors, (710), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:07:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 838 transitions. [2025-03-04 01:07:51,785 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 838 transitions. Word has length 154 [2025-03-04 01:07:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:51,786 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 838 transitions. [2025-03-04 01:07:51,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:07:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 838 transitions. [2025-03-04 01:07:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:07:51,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:51,787 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:07:51,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:51,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 193560388, now seen corresponding path program 1 times [2025-03-04 01:07:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:51,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931654392] [2025-03-04 01:07:51,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:51,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:07:51,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:07:51,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:51,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931654392] [2025-03-04 01:07:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931654392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:52,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:52,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:07:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996586205] [2025-03-04 01:07:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:52,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:07:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:52,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:07:52,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:07:52,867 INFO L87 Difference]: Start difference. First operand 583 states and 838 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:54,483 INFO L93 Difference]: Finished difference Result 1531 states and 2177 transitions. [2025-03-04 01:07:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 01:07:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:07:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:54,487 INFO L225 Difference]: With dead ends: 1531 [2025-03-04 01:07:54,487 INFO L226 Difference]: Without dead ends: 951 [2025-03-04 01:07:54,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1926, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 01:07:54,489 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1171 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:54,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 2709 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:07:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-04 01:07:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 678. [2025-03-04 01:07:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 589 states have (on average 1.3633276740237692) internal successors, (803), 592 states have internal predecessors, (803), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 76 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 01:07:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 961 transitions. [2025-03-04 01:07:54,527 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 961 transitions. Word has length 155 [2025-03-04 01:07:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:54,527 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 961 transitions. [2025-03-04 01:07:54,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 961 transitions. [2025-03-04 01:07:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:07:54,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:54,529 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:07:54,530 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:54,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash 224580195, now seen corresponding path program 1 times [2025-03-04 01:07:54,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428990264] [2025-03-04 01:07:54,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:54,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:07:54,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:07:54,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:54,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428990264] [2025-03-04 01:07:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428990264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:55,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:55,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:07:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124491528] [2025-03-04 01:07:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:55,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:07:55,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:55,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:07:55,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:07:55,230 INFO L87 Difference]: Start difference. First operand 678 states and 961 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:56,147 INFO L93 Difference]: Finished difference Result 1549 states and 2190 transitions. [2025-03-04 01:07:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:07:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:07:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:56,151 INFO L225 Difference]: With dead ends: 1549 [2025-03-04 01:07:56,151 INFO L226 Difference]: Without dead ends: 874 [2025-03-04 01:07:56,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:07:56,153 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 789 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:56,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1735 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:07:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-04 01:07:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 713. [2025-03-04 01:07:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 611 states have (on average 1.353518821603928) internal successors, (827), 615 states have internal predecessors, (827), 90 states have call successors, (90), 11 states have call predecessors, (90), 11 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:07:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1007 transitions. [2025-03-04 01:07:56,207 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1007 transitions. Word has length 155 [2025-03-04 01:07:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:56,207 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1007 transitions. [2025-03-04 01:07:56,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:07:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1007 transitions. [2025-03-04 01:07:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:07:56,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:56,209 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:07:56,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash 110366481, now seen corresponding path program 1 times [2025-03-04 01:07:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:07:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439149935] [2025-03-04 01:07:56,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:07:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:07:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:07:56,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:07:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:07:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439149935] [2025-03-04 01:07:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439149935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-04 01:07:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447919095] [2025-03-04 01:07:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 01:07:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:07:58,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 01:07:58,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:07:58,403 INFO L87 Difference]: Start difference. First operand 713 states and 1007 transitions. Second operand has 24 states, 20 states have (on average 3.15) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:08:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:01,305 INFO L93 Difference]: Finished difference Result 1706 states and 2403 transitions. [2025-03-04 01:08:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 01:08:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2025-03-04 01:08:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:01,309 INFO L225 Difference]: With dead ends: 1706 [2025-03-04 01:08:01,310 INFO L226 Difference]: Without dead ends: 1028 [2025-03-04 01:08:01,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 01:08:01,312 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 667 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 2981 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:01,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 5155 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2981 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 01:08:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-03-04 01:08:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 757. [2025-03-04 01:08:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 655 states have (on average 1.3618320610687022) internal successors, (892), 659 states have internal predecessors, (892), 90 states have call successors, (90), 11 states have call predecessors, (90), 11 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:08:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1072 transitions. [2025-03-04 01:08:01,358 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1072 transitions. Word has length 155 [2025-03-04 01:08:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1072 transitions. [2025-03-04 01:08:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:08:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1072 transitions. [2025-03-04 01:08:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:01,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:01,360 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:01,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:08:01,360 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:01,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -183036526, now seen corresponding path program 1 times [2025-03-04 01:08:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926199685] [2025-03-04 01:08:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:01,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:01,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:01,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926199685] [2025-03-04 01:08:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926199685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:08:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107267182] [2025-03-04 01:08:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:08:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:01,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:08:01,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:01,745 INFO L87 Difference]: Start difference. First operand 757 states and 1072 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:01,984 INFO L93 Difference]: Finished difference Result 1645 states and 2315 transitions. [2025-03-04 01:08:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:08:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:01,988 INFO L225 Difference]: With dead ends: 1645 [2025-03-04 01:08:01,988 INFO L226 Difference]: Without dead ends: 923 [2025-03-04 01:08:01,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:08:01,991 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 194 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:01,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 744 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-04 01:08:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 840. [2025-03-04 01:08:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 722 states have (on average 1.3448753462603877) internal successors, (971), 727 states have internal predecessors, (971), 103 states have call successors, (103), 14 states have call predecessors, (103), 14 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-04 01:08:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1177 transitions. [2025-03-04 01:08:02,047 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1177 transitions. Word has length 155 [2025-03-04 01:08:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:02,047 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1177 transitions. [2025-03-04 01:08:02,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1177 transitions. [2025-03-04 01:08:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:02,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:02,048 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:08:02,049 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -144370064, now seen corresponding path program 1 times [2025-03-04 01:08:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065036529] [2025-03-04 01:08:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:02,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:02,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:02,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:02,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065036529] [2025-03-04 01:08:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065036529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093771370] [2025-03-04 01:08:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:02,312 INFO L87 Difference]: Start difference. First operand 840 states and 1177 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:02,557 INFO L93 Difference]: Finished difference Result 1701 states and 2378 transitions. [2025-03-04 01:08:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:02,561 INFO L225 Difference]: With dead ends: 1701 [2025-03-04 01:08:02,561 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 01:08:02,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:08:02,563 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 131 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:02,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 664 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 01:08:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 813. [2025-03-04 01:08:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 695 states have (on average 1.339568345323741) internal successors, (931), 700 states have internal predecessors, (931), 103 states have call successors, (103), 14 states have call predecessors, (103), 14 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-04 01:08:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1137 transitions. [2025-03-04 01:08:02,622 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1137 transitions. Word has length 155 [2025-03-04 01:08:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:02,622 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1137 transitions. [2025-03-04 01:08:02,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1137 transitions. [2025-03-04 01:08:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:02,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:02,624 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:02,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:08:02,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:02,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1558186212, now seen corresponding path program 1 times [2025-03-04 01:08:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438813189] [2025-03-04 01:08:02,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:02,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:02,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438813189] [2025-03-04 01:08:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438813189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:08:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099240302] [2025-03-04 01:08:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:03,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:08:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:08:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:03,018 INFO L87 Difference]: Start difference. First operand 813 states and 1137 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:03,268 INFO L93 Difference]: Finished difference Result 1357 states and 1910 transitions. [2025-03-04 01:08:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:08:03,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:03,273 INFO L225 Difference]: With dead ends: 1357 [2025-03-04 01:08:03,273 INFO L226 Difference]: Without dead ends: 1068 [2025-03-04 01:08:03,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:08:03,274 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 124 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:03,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1218 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-04 01:08:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1059. [2025-03-04 01:08:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 910 states have (on average 1.3494505494505495) internal successors, (1228), 917 states have internal predecessors, (1228), 131 states have call successors, (131), 17 states have call predecessors, (131), 17 states have return successors, (131), 124 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-04 01:08:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1490 transitions. [2025-03-04 01:08:03,343 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1490 transitions. Word has length 155 [2025-03-04 01:08:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:03,344 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1490 transitions. [2025-03-04 01:08:03,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1490 transitions. [2025-03-04 01:08:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:03,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:03,346 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:03,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:08:03,346 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1081094865, now seen corresponding path program 1 times [2025-03-04 01:08:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-04 01:08:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:03,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:04,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-04 01:08:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903953065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:04,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 01:08:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410311718] [2025-03-04 01:08:04,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:08:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:04,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:08:04,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:08:04,665 INFO L87 Difference]: Start difference. First operand 1059 states and 1490 transitions. Second operand has 21 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 21 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:07,046 INFO L93 Difference]: Finished difference Result 2334 states and 3272 transitions. [2025-03-04 01:08:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 01:08:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 21 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:08:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:07,053 INFO L225 Difference]: With dead ends: 2334 [2025-03-04 01:08:07,053 INFO L226 Difference]: Without dead ends: 1310 [2025-03-04 01:08:07,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=328, Invalid=1928, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 01:08:07,055 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 590 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 4894 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:07,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 4894 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:08:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-03-04 01:08:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1075. [2025-03-04 01:08:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 926 states have (on average 1.3520518358531317) internal successors, (1252), 933 states have internal predecessors, (1252), 131 states have call successors, (131), 17 states have call predecessors, (131), 17 states have return successors, (131), 124 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-04 01:08:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1514 transitions. [2025-03-04 01:08:07,131 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1514 transitions. Word has length 155 [2025-03-04 01:08:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1514 transitions. [2025-03-04 01:08:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 21 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1514 transitions. [2025-03-04 01:08:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:07,133 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:08:07,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -643407711, now seen corresponding path program 1 times [2025-03-04 01:08:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337608814] [2025-03-04 01:08:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:07,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:07,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337608814] [2025-03-04 01:08:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337608814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:08:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548926482] [2025-03-04 01:08:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:08:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:07,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:08:07,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:07,795 INFO L87 Difference]: Start difference. First operand 1075 states and 1514 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:08,095 INFO L93 Difference]: Finished difference Result 2391 states and 3370 transitions. [2025-03-04 01:08:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:08:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:08,102 INFO L225 Difference]: With dead ends: 2391 [2025-03-04 01:08:08,102 INFO L226 Difference]: Without dead ends: 1351 [2025-03-04 01:08:08,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:08,104 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 111 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:08,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 988 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-03-04 01:08:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1229. [2025-03-04 01:08:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1072 states have (on average 1.3647388059701493) internal successors, (1463), 1080 states have internal predecessors, (1463), 140 states have call successors, (140), 16 states have call predecessors, (140), 16 states have return successors, (140), 132 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:08:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1743 transitions. [2025-03-04 01:08:08,158 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1743 transitions. Word has length 155 [2025-03-04 01:08:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:08,158 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1743 transitions. [2025-03-04 01:08:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1743 transitions. [2025-03-04 01:08:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:08,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:08,161 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:08:08,162 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -514324992, now seen corresponding path program 1 times [2025-03-04 01:08:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803578559] [2025-03-04 01:08:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:08,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:08,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803578559] [2025-03-04 01:08:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803578559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:09,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:09,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:08:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277055766] [2025-03-04 01:08:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:09,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:08:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:09,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:08:09,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:08:09,560 INFO L87 Difference]: Start difference. First operand 1229 states and 1743 transitions. Second operand has 19 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:08:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:10,728 INFO L93 Difference]: Finished difference Result 2735 states and 3874 transitions. [2025-03-04 01:08:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:08:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2025-03-04 01:08:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:10,734 INFO L225 Difference]: With dead ends: 2735 [2025-03-04 01:08:10,734 INFO L226 Difference]: Without dead ends: 1509 [2025-03-04 01:08:10,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:08:10,736 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 280 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:10,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2786 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:08:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-03-04 01:08:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1502. [2025-03-04 01:08:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1315 states have (on average 1.361977186311787) internal successors, (1791), 1326 states have internal predecessors, (1791), 167 states have call successors, (167), 19 states have call predecessors, (167), 19 states have return successors, (167), 156 states have call predecessors, (167), 167 states have call successors, (167) [2025-03-04 01:08:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2125 transitions. [2025-03-04 01:08:10,831 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2125 transitions. Word has length 155 [2025-03-04 01:08:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:10,831 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2125 transitions. [2025-03-04 01:08:10,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:08:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2125 transitions. [2025-03-04 01:08:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:10,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:10,833 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:08:10,834 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:10,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1019883617, now seen corresponding path program 1 times [2025-03-04 01:08:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476587134] [2025-03-04 01:08:10,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:10,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:10,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:10,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476587134] [2025-03-04 01:08:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476587134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270858015] [2025-03-04 01:08:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:11,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:11,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:11,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:11,220 INFO L87 Difference]: Start difference. First operand 1502 states and 2125 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:11,429 INFO L93 Difference]: Finished difference Result 3248 states and 4600 transitions. [2025-03-04 01:08:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:11,439 INFO L225 Difference]: With dead ends: 3248 [2025-03-04 01:08:11,439 INFO L226 Difference]: Without dead ends: 1749 [2025-03-04 01:08:11,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:08:11,442 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 106 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:11,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 987 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-04 01:08:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1741. [2025-03-04 01:08:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1524 states have (on average 1.3628608923884515) internal successors, (2077), 1538 states have internal predecessors, (2077), 194 states have call successors, (194), 22 states have call predecessors, (194), 22 states have return successors, (194), 180 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-04 01:08:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2465 transitions. [2025-03-04 01:08:11,511 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2465 transitions. Word has length 155 [2025-03-04 01:08:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2465 transitions. [2025-03-04 01:08:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2465 transitions. [2025-03-04 01:08:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:11,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:11,513 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:11,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:08:11,513 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:11,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1605021728, now seen corresponding path program 1 times [2025-03-04 01:08:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:11,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539147331] [2025-03-04 01:08:11,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:11,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539147331] [2025-03-04 01:08:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539147331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:08:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071705709] [2025-03-04 01:08:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:08:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:12,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:08:12,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:08:12,382 INFO L87 Difference]: Start difference. First operand 1741 states and 2465 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:12,999 INFO L93 Difference]: Finished difference Result 3517 states and 4970 transitions. [2025-03-04 01:08:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:08:13,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:08:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:13,006 INFO L225 Difference]: With dead ends: 3517 [2025-03-04 01:08:13,006 INFO L226 Difference]: Without dead ends: 1779 [2025-03-04 01:08:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:08:13,009 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 118 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:13,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2824 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:08:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-03-04 01:08:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1774. [2025-03-04 01:08:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1548 states have (on average 1.357235142118863) internal successors, (2101), 1562 states have internal predecessors, (2101), 200 states have call successors, (200), 25 states have call predecessors, (200), 25 states have return successors, (200), 186 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-04 01:08:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2501 transitions. [2025-03-04 01:08:13,089 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2501 transitions. Word has length 155 [2025-03-04 01:08:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:13,089 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2501 transitions. [2025-03-04 01:08:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2501 transitions. [2025-03-04 01:08:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:13,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:13,093 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:13,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:08:13,093 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1475939009, now seen corresponding path program 1 times [2025-03-04 01:08:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140333268] [2025-03-04 01:08:13,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:13,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:13,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:13,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:13,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140333268] [2025-03-04 01:08:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140333268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:08:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764603703] [2025-03-04 01:08:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:13,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:08:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:13,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:08:13,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:13,633 INFO L87 Difference]: Start difference. First operand 1774 states and 2501 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:13,929 INFO L93 Difference]: Finished difference Result 3553 states and 5000 transitions. [2025-03-04 01:08:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:08:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:13,934 INFO L225 Difference]: With dead ends: 3553 [2025-03-04 01:08:13,934 INFO L226 Difference]: Without dead ends: 1782 [2025-03-04 01:08:13,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:13,936 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 109 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:13,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1277 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-04 01:08:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1577. [2025-03-04 01:08:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1384 states have (on average 1.35621387283237) internal successors, (1877), 1395 states have internal predecessors, (1877), 167 states have call successors, (167), 25 states have call predecessors, (167), 25 states have return successors, (167), 156 states have call predecessors, (167), 167 states have call successors, (167) [2025-03-04 01:08:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2211 transitions. [2025-03-04 01:08:14,003 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2211 transitions. Word has length 155 [2025-03-04 01:08:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2211 transitions. [2025-03-04 01:08:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2211 transitions. [2025-03-04 01:08:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:14,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:14,005 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:08:14,006 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:14,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 178776705, now seen corresponding path program 1 times [2025-03-04 01:08:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517492878] [2025-03-04 01:08:14,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:14,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:14,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:14,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517492878] [2025-03-04 01:08:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517492878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695543152] [2025-03-04 01:08:14,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:14,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:14,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:14,319 INFO L87 Difference]: Start difference. First operand 1577 states and 2211 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:14,545 INFO L93 Difference]: Finished difference Result 3197 states and 4472 transitions. [2025-03-04 01:08:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:14,550 INFO L225 Difference]: With dead ends: 3197 [2025-03-04 01:08:14,550 INFO L226 Difference]: Without dead ends: 1623 [2025-03-04 01:08:14,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:08:14,552 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 108 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 851 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-03-04 01:08:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1198. [2025-03-04 01:08:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1071 states have (on average 1.3650793650793651) internal successors, (1462), 1076 states have internal predecessors, (1462), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1676 transitions. [2025-03-04 01:08:14,612 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1676 transitions. Word has length 155 [2025-03-04 01:08:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1676 transitions. [2025-03-04 01:08:14,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1676 transitions. [2025-03-04 01:08:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:14,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:14,613 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:08:14,614 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -326781920, now seen corresponding path program 1 times [2025-03-04 01:08:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127785468] [2025-03-04 01:08:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:14,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:14,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:15,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127785468] [2025-03-04 01:08:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127785468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:15,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:15,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:08:15,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400946198] [2025-03-04 01:08:15,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:08:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:15,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:08:15,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:08:15,241 INFO L87 Difference]: Start difference. First operand 1198 states and 1676 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:15,668 INFO L93 Difference]: Finished difference Result 2586 states and 3616 transitions. [2025-03-04 01:08:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:08:15,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:15,672 INFO L225 Difference]: With dead ends: 2586 [2025-03-04 01:08:15,672 INFO L226 Difference]: Without dead ends: 1391 [2025-03-04 01:08:15,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:08:15,674 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 109 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:15,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 2153 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:08:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-04 01:08:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1192. [2025-03-04 01:08:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1065 states have (on average 1.3671361502347419) internal successors, (1456), 1070 states have internal predecessors, (1456), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1670 transitions. [2025-03-04 01:08:15,745 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1670 transitions. Word has length 155 [2025-03-04 01:08:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:15,745 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1670 transitions. [2025-03-04 01:08:15,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1670 transitions. [2025-03-04 01:08:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:08:15,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:15,746 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:08:15,746 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:15,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1417478656, now seen corresponding path program 1 times [2025-03-04 01:08:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:15,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667663405] [2025-03-04 01:08:15,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:15,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:08:15,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:08:15,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:15,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667663405] [2025-03-04 01:08:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667663405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:08:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226405171] [2025-03-04 01:08:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:08:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:08:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:08:16,318 INFO L87 Difference]: Start difference. First operand 1192 states and 1670 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:16,756 INFO L93 Difference]: Finished difference Result 2565 states and 3592 transitions. [2025-03-04 01:08:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:08:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:08:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:16,759 INFO L225 Difference]: With dead ends: 2565 [2025-03-04 01:08:16,759 INFO L226 Difference]: Without dead ends: 1376 [2025-03-04 01:08:16,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:08:16,761 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 109 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:16,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 2157 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:08:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-04 01:08:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1177. [2025-03-04 01:08:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1050 states have (on average 1.3695238095238096) internal successors, (1438), 1055 states have internal predecessors, (1438), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1652 transitions. [2025-03-04 01:08:16,821 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1652 transitions. Word has length 155 [2025-03-04 01:08:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:16,822 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1652 transitions. [2025-03-04 01:08:16,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1652 transitions. [2025-03-04 01:08:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:08:16,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:16,823 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:16,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:08:16,823 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:16,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2008641356, now seen corresponding path program 1 times [2025-03-04 01:08:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:16,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368910915] [2025-03-04 01:08:16,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:16,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:08:16,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:08:16,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:16,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:08:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368910915] [2025-03-04 01:08:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368910915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139680698] [2025-03-04 01:08:16,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:16,933 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:08:16,933 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:08:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:08:17,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:08:17,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:17,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:17,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:08:17,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:17,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139680698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:08:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:08:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243292348] [2025-03-04 01:08:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:08:17,165 INFO L87 Difference]: Start difference. First operand 1177 states and 1652 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:17,261 INFO L93 Difference]: Finished difference Result 2379 states and 3336 transitions. [2025-03-04 01:08:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-03-04 01:08:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:17,264 INFO L225 Difference]: With dead ends: 2379 [2025-03-04 01:08:17,264 INFO L226 Difference]: Without dead ends: 1205 [2025-03-04 01:08:17,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:08:17,266 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:17,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-04 01:08:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1184. [2025-03-04 01:08:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1057 states have (on average 1.3670766319772942) internal successors, (1445), 1062 states have internal predecessors, (1445), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1659 transitions. [2025-03-04 01:08:17,327 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1659 transitions. Word has length 156 [2025-03-04 01:08:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:17,327 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1659 transitions. [2025-03-04 01:08:17,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1659 transitions. [2025-03-04 01:08:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:08:17,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:17,328 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,334 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:08:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:17,528 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:17,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1188400590, now seen corresponding path program 1 times [2025-03-04 01:08:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882254976] [2025-03-04 01:08:17,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:17,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:08:17,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:08:17,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:17,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882254976] [2025-03-04 01:08:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882254976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:17,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54870986] [2025-03-04 01:08:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:17,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:17,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:17,838 INFO L87 Difference]: Start difference. First operand 1184 states and 1659 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:18,073 INFO L93 Difference]: Finished difference Result 1937 states and 2711 transitions. [2025-03-04 01:08:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-03-04 01:08:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:18,077 INFO L225 Difference]: With dead ends: 1937 [2025-03-04 01:08:18,077 INFO L226 Difference]: Without dead ends: 1187 [2025-03-04 01:08:18,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:18,078 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 123 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:18,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 762 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-04 01:08:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1184. [2025-03-04 01:08:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1057 states have (on average 1.3642384105960266) internal successors, (1442), 1062 states have internal predecessors, (1442), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1656 transitions. [2025-03-04 01:08:18,138 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1656 transitions. Word has length 158 [2025-03-04 01:08:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:18,139 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1656 transitions. [2025-03-04 01:08:18,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1656 transitions. [2025-03-04 01:08:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:08:18,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:18,140 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:08:18,140 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1059317871, now seen corresponding path program 1 times [2025-03-04 01:08:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776648375] [2025-03-04 01:08:18,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:18,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:08:18,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:08:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:08:18,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776648375] [2025-03-04 01:08:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776648375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307862232] [2025-03-04 01:08:18,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:18,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:18,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:08:18,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:08:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:08:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:08:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:18,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:18,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:08:18,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:18,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307862232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:18,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:08:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-04 01:08:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419668265] [2025-03-04 01:08:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:18,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:08:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:18,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:08:18,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:18,494 INFO L87 Difference]: Start difference. First operand 1184 states and 1656 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:18,583 INFO L93 Difference]: Finished difference Result 2383 states and 3330 transitions. [2025-03-04 01:08:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:08:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:18,588 INFO L225 Difference]: With dead ends: 2383 [2025-03-04 01:08:18,588 INFO L226 Difference]: Without dead ends: 1202 [2025-03-04 01:08:18,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:18,590 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:18,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-03-04 01:08:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1174. [2025-03-04 01:08:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1047 states have (on average 1.3638968481375358) internal successors, (1428), 1052 states have internal predecessors, (1428), 107 states have call successors, (107), 19 states have call predecessors, (107), 19 states have return successors, (107), 102 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:08:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1642 transitions. [2025-03-04 01:08:18,658 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1642 transitions. Word has length 158 [2025-03-04 01:08:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1642 transitions. [2025-03-04 01:08:18,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1642 transitions. [2025-03-04 01:08:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:08:18,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:18,659 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:08:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:18,860 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:18,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 772546119, now seen corresponding path program 1 times [2025-03-04 01:08:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11681786] [2025-03-04 01:08:18,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:18,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:08:18,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:08:18,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:18,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11681786] [2025-03-04 01:08:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11681786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:08:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902680170] [2025-03-04 01:08:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:19,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:08:19,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:19,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:08:19,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:19,161 INFO L87 Difference]: Start difference. First operand 1174 states and 1642 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:19,399 INFO L93 Difference]: Finished difference Result 1841 states and 2530 transitions. [2025-03-04 01:08:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:08:19,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:08:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:19,404 INFO L225 Difference]: With dead ends: 1841 [2025-03-04 01:08:19,404 INFO L226 Difference]: Without dead ends: 1839 [2025-03-04 01:08:19,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:19,404 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 73 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:19,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1044 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-04 01:08:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1830. [2025-03-04 01:08:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1668 states have (on average 1.3453237410071943) internal successors, (2244), 1680 states have internal predecessors, (2244), 135 states have call successors, (135), 26 states have call predecessors, (135), 26 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 01:08:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2514 transitions. [2025-03-04 01:08:19,497 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2514 transitions. Word has length 158 [2025-03-04 01:08:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:19,497 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2514 transitions. [2025-03-04 01:08:19,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2514 transitions. [2025-03-04 01:08:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:08:19,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:19,499 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:08:19,499 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash -495298893, now seen corresponding path program 1 times [2025-03-04 01:08:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341730980] [2025-03-04 01:08:19,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:08:19,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:08:19,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341730980] [2025-03-04 01:08:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341730980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:19,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:08:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464534668] [2025-03-04 01:08:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:08:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:19,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:08:19,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:08:19,602 INFO L87 Difference]: Start difference. First operand 1830 states and 2514 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:19,905 INFO L93 Difference]: Finished difference Result 5146 states and 6966 transitions. [2025-03-04 01:08:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:08:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:08:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:19,914 INFO L225 Difference]: With dead ends: 5146 [2025-03-04 01:08:19,914 INFO L226 Difference]: Without dead ends: 3319 [2025-03-04 01:08:19,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:08:19,919 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:19,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 551 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-03-04 01:08:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2242. [2025-03-04 01:08:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2080 states have (on average 1.2875) internal successors, (2678), 2092 states have internal predecessors, (2678), 135 states have call successors, (135), 26 states have call predecessors, (135), 26 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 01:08:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2948 transitions. [2025-03-04 01:08:20,030 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2948 transitions. Word has length 158 [2025-03-04 01:08:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 2948 transitions. [2025-03-04 01:08:20,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2948 transitions. [2025-03-04 01:08:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:08:20,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:20,032 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:08:20,032 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1147601614, now seen corresponding path program 1 times [2025-03-04 01:08:20,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:20,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388084465] [2025-03-04 01:08:20,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:08:20,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:08:20,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:20,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388084465] [2025-03-04 01:08:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388084465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:21,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:21,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:08:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066830279] [2025-03-04 01:08:21,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:08:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:21,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:08:21,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:08:21,516 INFO L87 Difference]: Start difference. First operand 2242 states and 2948 transitions. Second operand has 20 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-04 01:08:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:24,526 INFO L93 Difference]: Finished difference Result 4958 states and 6506 transitions. [2025-03-04 01:08:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:08:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) Word has length 159 [2025-03-04 01:08:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:24,533 INFO L225 Difference]: With dead ends: 4958 [2025-03-04 01:08:24,533 INFO L226 Difference]: Without dead ends: 2719 [2025-03-04 01:08:24,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:08:24,537 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 460 mSDsluCounter, 2725 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:24,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3005 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:08:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-03-04 01:08:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2386. [2025-03-04 01:08:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2213 states have (on average 1.2824220515137823) internal successors, (2838), 2226 states have internal predecessors, (2838), 144 states have call successors, (144), 28 states have call predecessors, (144), 28 states have return successors, (144), 131 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:08:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3126 transitions. [2025-03-04 01:08:24,673 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3126 transitions. Word has length 159 [2025-03-04 01:08:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3126 transitions. [2025-03-04 01:08:24,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-04 01:08:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3126 transitions. [2025-03-04 01:08:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:08:24,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:24,676 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:08:24,676 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:24,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -987867374, now seen corresponding path program 1 times [2025-03-04 01:08:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170598861] [2025-03-04 01:08:24,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:24,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:08:24,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:08:24,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:24,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170598861] [2025-03-04 01:08:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170598861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:08:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938113016] [2025-03-04 01:08:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:08:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:25,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:08:25,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:08:25,164 INFO L87 Difference]: Start difference. First operand 2386 states and 3126 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:25,680 INFO L93 Difference]: Finished difference Result 5150 states and 6742 transitions. [2025-03-04 01:08:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:08:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 159 [2025-03-04 01:08:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:25,686 INFO L225 Difference]: With dead ends: 5150 [2025-03-04 01:08:25,686 INFO L226 Difference]: Without dead ends: 2799 [2025-03-04 01:08:25,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:25,689 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 225 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:25,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1688 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:08:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2025-03-04 01:08:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2386. [2025-03-04 01:08:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2213 states have (on average 1.2824220515137823) internal successors, (2838), 2226 states have internal predecessors, (2838), 144 states have call successors, (144), 28 states have call predecessors, (144), 28 states have return successors, (144), 131 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:08:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3126 transitions. [2025-03-04 01:08:25,827 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3126 transitions. Word has length 159 [2025-03-04 01:08:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:25,827 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3126 transitions. [2025-03-04 01:08:25,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3126 transitions. [2025-03-04 01:08:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:08:25,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:25,829 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:08:25,830 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash -33383598, now seen corresponding path program 1 times [2025-03-04 01:08:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133161185] [2025-03-04 01:08:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:08:25,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:08:25,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:25,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133161185] [2025-03-04 01:08:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133161185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:08:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403821181] [2025-03-04 01:08:26,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:08:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:08:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:26,286 INFO L87 Difference]: Start difference. First operand 2386 states and 3126 transitions. Second operand has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:26,631 INFO L93 Difference]: Finished difference Result 4746 states and 6215 transitions. [2025-03-04 01:08:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 159 [2025-03-04 01:08:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:26,637 INFO L225 Difference]: With dead ends: 4746 [2025-03-04 01:08:26,637 INFO L226 Difference]: Without dead ends: 2395 [2025-03-04 01:08:26,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:26,640 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 110 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:26,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1268 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2025-03-04 01:08:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2272. [2025-03-04 01:08:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2098 states have (on average 1.2836034318398475) internal successors, (2693), 2111 states have internal predecessors, (2693), 144 states have call successors, (144), 29 states have call predecessors, (144), 29 states have return successors, (144), 131 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:08:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2981 transitions. [2025-03-04 01:08:26,794 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2981 transitions. Word has length 159 [2025-03-04 01:08:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2981 transitions. [2025-03-04 01:08:26,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2981 transitions. [2025-03-04 01:08:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:08:26,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:26,797 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:26,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:08:26,797 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:26,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1745242410, now seen corresponding path program 1 times [2025-03-04 01:08:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523296926] [2025-03-04 01:08:26,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:26,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:08:26,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:08:26,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:26,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:27,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523296926] [2025-03-04 01:08:27,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523296926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:27,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:27,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734886334] [2025-03-04 01:08:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:27,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:27,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:27,167 INFO L87 Difference]: Start difference. First operand 2272 states and 2981 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:27,378 INFO L93 Difference]: Finished difference Result 6141 states and 8049 transitions. [2025-03-04 01:08:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:27,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-04 01:08:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:27,386 INFO L225 Difference]: With dead ends: 6141 [2025-03-04 01:08:27,386 INFO L226 Difference]: Without dead ends: 3904 [2025-03-04 01:08:27,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:08:27,392 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 114 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:27,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 793 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2025-03-04 01:08:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3706. [2025-03-04 01:08:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3532 states have (on average 1.282559456398641) internal successors, (4530), 3545 states have internal predecessors, (4530), 144 states have call successors, (144), 29 states have call predecessors, (144), 29 states have return successors, (144), 131 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:08:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 4818 transitions. [2025-03-04 01:08:27,598 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 4818 transitions. Word has length 160 [2025-03-04 01:08:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 3706 states and 4818 transitions. [2025-03-04 01:08:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 4818 transitions. [2025-03-04 01:08:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:08:27,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:27,602 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:27,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:08:27,602 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:27,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1052140713, now seen corresponding path program 1 times [2025-03-04 01:08:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808922030] [2025-03-04 01:08:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:27,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:08:27,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:08:27,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808922030] [2025-03-04 01:08:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808922030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921641172] [2025-03-04 01:08:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:28,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:28,042 INFO L87 Difference]: Start difference. First operand 3706 states and 4818 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:28,316 INFO L93 Difference]: Finished difference Result 8350 states and 10808 transitions. [2025-03-04 01:08:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:28,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-04 01:08:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:28,323 INFO L225 Difference]: With dead ends: 8350 [2025-03-04 01:08:28,324 INFO L226 Difference]: Without dead ends: 4679 [2025-03-04 01:08:28,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:08:28,328 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 126 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:28,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 830 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2025-03-04 01:08:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4649. [2025-03-04 01:08:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 4433 states have (on average 1.2740807579517257) internal successors, (5648), 4460 states have internal predecessors, (5648), 172 states have call successors, (172), 43 states have call predecessors, (172), 43 states have return successors, (172), 145 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 01:08:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 5992 transitions. [2025-03-04 01:08:28,556 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 5992 transitions. Word has length 160 [2025-03-04 01:08:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:28,556 INFO L471 AbstractCegarLoop]: Abstraction has 4649 states and 5992 transitions. [2025-03-04 01:08:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 5992 transitions. [2025-03-04 01:08:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:08:28,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:28,559 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 01:08:28,559 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:28,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1525034443, now seen corresponding path program 1 times [2025-03-04 01:08:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:28,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662160859] [2025-03-04 01:08:28,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:28,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:08:28,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:08:28,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:28,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662160859] [2025-03-04 01:08:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662160859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:08:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325273786] [2025-03-04 01:08:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:28,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:08:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:28,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:08:28,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:08:28,666 INFO L87 Difference]: Start difference. First operand 4649 states and 5992 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:28,854 INFO L93 Difference]: Finished difference Result 9263 states and 11939 transitions. [2025-03-04 01:08:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:08:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-03-04 01:08:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:28,862 INFO L225 Difference]: With dead ends: 9263 [2025-03-04 01:08:28,862 INFO L226 Difference]: Without dead ends: 4649 [2025-03-04 01:08:28,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:08:28,868 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:28,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2025-03-04 01:08:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4649. [2025-03-04 01:08:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 4433 states have (on average 1.2131739228513423) internal successors, (5378), 4460 states have internal predecessors, (5378), 172 states have call successors, (172), 43 states have call predecessors, (172), 43 states have return successors, (172), 145 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 01:08:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 5722 transitions. [2025-03-04 01:08:29,077 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 5722 transitions. Word has length 160 [2025-03-04 01:08:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:29,078 INFO L471 AbstractCegarLoop]: Abstraction has 4649 states and 5722 transitions. [2025-03-04 01:08:29,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 5722 transitions. [2025-03-04 01:08:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:08:29,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:29,081 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:29,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 01:08:29,081 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:29,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1380353727, now seen corresponding path program 1 times [2025-03-04 01:08:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871564032] [2025-03-04 01:08:29,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:29,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:08:29,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:08:29,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:29,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871564032] [2025-03-04 01:08:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871564032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398107701] [2025-03-04 01:08:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:29,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:29,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:29,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:29,425 INFO L87 Difference]: Start difference. First operand 4649 states and 5722 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:29,689 INFO L93 Difference]: Finished difference Result 9423 states and 11592 transitions. [2025-03-04 01:08:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:29,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-03-04 01:08:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:29,696 INFO L225 Difference]: With dead ends: 9423 [2025-03-04 01:08:29,696 INFO L226 Difference]: Without dead ends: 4809 [2025-03-04 01:08:29,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:29,700 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 122 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:29,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 594 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-04 01:08:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4653. [2025-03-04 01:08:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4436 states have (on average 1.2114517583408475) internal successors, (5374), 4463 states have internal predecessors, (5374), 172 states have call successors, (172), 44 states have call predecessors, (172), 44 states have return successors, (172), 145 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 01:08:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 5718 transitions. [2025-03-04 01:08:29,919 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 5718 transitions. Word has length 161 [2025-03-04 01:08:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 4653 states and 5718 transitions. [2025-03-04 01:08:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 5718 transitions. [2025-03-04 01:08:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:08:29,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:29,923 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 01:08:29,923 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1183840222, now seen corresponding path program 1 times [2025-03-04 01:08:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11463625] [2025-03-04 01:08:29,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:08:29,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:08:29,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:29,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11463625] [2025-03-04 01:08:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11463625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:30,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:30,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415395196] [2025-03-04 01:08:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:30,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:30,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:30,282 INFO L87 Difference]: Start difference. First operand 4653 states and 5718 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:30,561 INFO L93 Difference]: Finished difference Result 9269 states and 11389 transitions. [2025-03-04 01:08:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-03-04 01:08:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:30,567 INFO L225 Difference]: With dead ends: 9269 [2025-03-04 01:08:30,567 INFO L226 Difference]: Without dead ends: 4655 [2025-03-04 01:08:30,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:08:30,571 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 121 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:30,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 631 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-03-04 01:08:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4653. [2025-03-04 01:08:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4436 states have (on average 1.206717763751127) internal successors, (5353), 4463 states have internal predecessors, (5353), 172 states have call successors, (172), 44 states have call predecessors, (172), 44 states have return successors, (172), 145 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 01:08:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 5697 transitions. [2025-03-04 01:08:30,927 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 5697 transitions. Word has length 161 [2025-03-04 01:08:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 4653 states and 5697 transitions. [2025-03-04 01:08:30,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 5697 transitions. [2025-03-04 01:08:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:08:30,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:30,931 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:30,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 01:08:30,932 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1467017471, now seen corresponding path program 1 times [2025-03-04 01:08:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096863995] [2025-03-04 01:08:30,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:30,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:08:30,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:08:30,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096863995] [2025-03-04 01:08:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096863995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:31,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601798397] [2025-03-04 01:08:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:31,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:08:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:31,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:08:31,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:31,106 INFO L87 Difference]: Start difference. First operand 4653 states and 5697 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:31,612 INFO L93 Difference]: Finished difference Result 11516 states and 14206 transitions. [2025-03-04 01:08:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:08:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-03-04 01:08:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:31,622 INFO L225 Difference]: With dead ends: 11516 [2025-03-04 01:08:31,622 INFO L226 Difference]: Without dead ends: 6888 [2025-03-04 01:08:31,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:08:31,626 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 156 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:31,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1107 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2025-03-04 01:08:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 5145. [2025-03-04 01:08:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 4928 states have (on average 1.1844561688311688) internal successors, (5837), 4955 states have internal predecessors, (5837), 172 states have call successors, (172), 44 states have call predecessors, (172), 44 states have return successors, (172), 145 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 01:08:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 6181 transitions. [2025-03-04 01:08:31,862 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 6181 transitions. Word has length 161 [2025-03-04 01:08:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:31,863 INFO L471 AbstractCegarLoop]: Abstraction has 5145 states and 6181 transitions. [2025-03-04 01:08:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 6181 transitions. [2025-03-04 01:08:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:08:31,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:31,865 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 01:08:31,865 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 961458846, now seen corresponding path program 1 times [2025-03-04 01:08:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124808204] [2025-03-04 01:08:31,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:31,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:08:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:08:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:08:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124808204] [2025-03-04 01:08:32,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124808204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202881618] [2025-03-04 01:08:32,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:32,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:08:32,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:08:32,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:08:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:08:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:32,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:08:32,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:08:32,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-03-04 01:08:32,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:08:32,692 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 36 treesize of output 12 [2025-03-04 01:08:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-04 01:08:32,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:08:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:08:32,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202881618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:08:32,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:08:32,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2025-03-04 01:08:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550076287] [2025-03-04 01:08:32,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:08:32,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:08:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:32,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:08:32,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:08:32,938 INFO L87 Difference]: Start difference. First operand 5145 states and 6181 transitions. Second operand has 18 states, 15 states have (on average 8.133333333333333) internal successors, (122), 18 states have internal predecessors, (122), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2025-03-04 01:08:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:33,833 INFO L93 Difference]: Finished difference Result 10141 states and 12370 transitions. [2025-03-04 01:08:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 01:08:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.133333333333333) internal successors, (122), 18 states have internal predecessors, (122), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) Word has length 161 [2025-03-04 01:08:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:33,841 INFO L225 Difference]: With dead ends: 10141 [2025-03-04 01:08:33,841 INFO L226 Difference]: Without dead ends: 5035 [2025-03-04 01:08:33,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=1284, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:08:33,846 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 596 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:33,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1140 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:08:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5035 states. [2025-03-04 01:08:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5035 to 4340. [2025-03-04 01:08:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 4073 states have (on average 1.1723545298305917) internal successors, (4775), 4100 states have internal predecessors, (4775), 202 states have call successors, (202), 64 states have call predecessors, (202), 64 states have return successors, (202), 175 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-04 01:08:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 5179 transitions. [2025-03-04 01:08:34,110 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 5179 transitions. Word has length 161 [2025-03-04 01:08:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:34,111 INFO L471 AbstractCegarLoop]: Abstraction has 4340 states and 5179 transitions. [2025-03-04 01:08:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.133333333333333) internal successors, (122), 18 states have internal predecessors, (122), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2025-03-04 01:08:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 5179 transitions. [2025-03-04 01:08:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:08:34,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:34,114 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:08:34,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 01:08:34,314 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:34,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 634699291, now seen corresponding path program 1 times [2025-03-04 01:08:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288073590] [2025-03-04 01:08:34,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:34,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:08:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:08:34,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:34,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288073590] [2025-03-04 01:08:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288073590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:34,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:08:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137777390] [2025-03-04 01:08:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:34,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:08:34,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:34,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:08:34,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:34,826 INFO L87 Difference]: Start difference. First operand 4340 states and 5179 transitions. Second operand has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:35,481 INFO L93 Difference]: Finished difference Result 6120 states and 7276 transitions. [2025-03-04 01:08:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:08:35,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2025-03-04 01:08:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:35,489 INFO L225 Difference]: With dead ends: 6120 [2025-03-04 01:08:35,489 INFO L226 Difference]: Without dead ends: 6118 [2025-03-04 01:08:35,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:08:35,491 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 189 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:35,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1914 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2025-03-04 01:08:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 5722. [2025-03-04 01:08:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5722 states, 5399 states have (on average 1.1685497314317466) internal successors, (6309), 5440 states have internal predecessors, (6309), 244 states have call successors, (244), 78 states have call predecessors, (244), 78 states have return successors, (244), 203 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-04 01:08:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5722 states to 5722 states and 6797 transitions. [2025-03-04 01:08:35,853 INFO L78 Accepts]: Start accepts. Automaton has 5722 states and 6797 transitions. Word has length 163 [2025-03-04 01:08:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:35,853 INFO L471 AbstractCegarLoop]: Abstraction has 5722 states and 6797 transitions. [2025-03-04 01:08:35,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:08:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5722 states and 6797 transitions. [2025-03-04 01:08:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:08:35,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:35,856 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:35,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 01:08:35,856 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:35,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -847053541, now seen corresponding path program 1 times [2025-03-04 01:08:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251573444] [2025-03-04 01:08:35,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:35,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:08:35,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:08:35,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:35,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:08:35,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:08:35,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:08:35,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:08:35,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:35,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:08:35,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:08:35,980 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:08:35,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:08:35,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 01:08:35,999 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:36,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:08:36,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:08:36 BoogieIcfgContainer [2025-03-04 01:08:36,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:08:36,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:08:36,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:08:36,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:08:36,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:07:35" (3/4) ... [2025-03-04 01:08:36,132 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:08:36,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:08:36,135 INFO L158 Benchmark]: Toolchain (without parser) took 61599.94ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 122.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.01ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: Boogie Preprocessor took 57.85ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 97.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: IcfgBuilder took 715.00ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 56.7MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: TraceAbstraction took 60525.60ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2025-03-04 01:08:36,135 INFO L158 Benchmark]: Witness Printer took 8.99ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 318.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:08:36,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.01ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.85ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 97.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 715.00ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 56.7MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60525.60ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. * Witness Printer took 8.99ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 318.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { 10.5, 99.25 }; [L25-L27] double double_Array_0[2] = { 10.5, 99.25 }; [L25-L27] double double_Array_0[2] = { 10.5, 99.25 }; [L28-L30] signed char signed_char_Array_0[1] = { 0 }; [L28-L30] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR unsigned_char_Array_0[0][1] [L101] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] double_Array_0[1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L83] EXPR double_Array_0[1] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] 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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L112] RET updateVariables() [L113] CALL step() [L38] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_ [L39] EXPR signed_char_Array_0[0] [L39] EXPR unsigned_char_Array_0[0][2] [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L39] EXPR signed_char_Array_0[0] [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] unsigned_char_Array_0[1][2] = ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))) [L43] EXPR unsigned_char_Array_0[0][0] [L43] EXPR unsigned_char_Array_0[1][2] [L43] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] COND FALSE !((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) [L46] EXPR BOOL_unsigned_char_Array_0[0] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1][2] [L47] EXPR unsigned_char_Array_0[0][0] [L47] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR unsigned_char_Array_0[0][0] << signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] COND FALSE !(unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) [L54] EXPR BOOL_unsigned_char_Array_0[4] [L54] BOOL_unsigned_char_Array_0[2] = BOOL_unsigned_char_Array_0[4] [L59] EXPR unsigned_char_Array_0[0][1] [L59] unsigned char stepLocal_1 = unsigned_char_Array_0[0][1]; [L60] EXPR BOOL_unsigned_char_Array_0[2] [L60] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L61] BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] COND TRUE BOOL_unsigned_char_Array_0[2] [L62] stepLocal_0 || BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, stepLocal_1=64, unsigned_char_Array_0={7:0}] [L62] stepLocal_0 || BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L62] COND TRUE stepLocal_0 || BOOL_unsigned_char_Array_0[2] [L63] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] COND TRUE stepLocal_1 > unsigned_char_Array_0[1][1] [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) [L104] EXPR unsigned_char_Array_0[1][2] [L104] EXPR signed_char_Array_0[0] [L104] EXPR unsigned_char_Array_0[0][2] [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L104] EXPR signed_char_Array_0[0] [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[2] [L104] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 [L104] EXPR unsigned_char_Array_0[0][1] [L104] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 [L104] EXPR double_Array_0[0] [L104] EXPR double_Array_0[1] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L104-L105] return (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) ; [L114] RET, EXPR property() [L114] 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_unsigned_char_Array_0_0__1_=64, signed_char_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_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.3s, OverallIterations: 50, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9260 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9212 mSDsluCounter, 65062 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54451 mSDsCounter, 1243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27363 IncrementalHoareTripleChecker+Invalid, 28606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1243 mSolverCounterUnsat, 10611 mSDtfsCounter, 27363 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1838 GetRequests, 1266 SyntacticMatches, 3 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5722occurred in iteration=49, InterpolantAutomatonStates: 489, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 49 MinimizatonAttempts, 10159 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 8567 NumberOfCodeBlocks, 8567 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 8510 ConstructedInterpolants, 0 QuantifiedInterpolants, 35691 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 55 InterpolantComputations, 48 PerfectInterpolantSequences, 37305/37620 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:08:36,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:08:38,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:08:38,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:08:38,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:08:38,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:08:38,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:08:38,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:08:38,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:08:38,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:08:38,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:08:38,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:08:38,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:08:38,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:08:38,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:08:38,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:08:38,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:08:38,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:08:38,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:08:38,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:08:38,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:08:38,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:08:38,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:08:38,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:08:38,208 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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2025-03-04 01:08:38,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:08:38,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:08:38,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:08:38,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:08:38,453 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:08:38,454 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-56.i [2025-03-04 01:08:39,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f51c712/91cc9253f6784e38928c3009e213c5c3/FLAGcbd4c8b3d [2025-03-04 01:08:39,805 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:08:39,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2025-03-04 01:08:39,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f51c712/91cc9253f6784e38928c3009e213c5c3/FLAGcbd4c8b3d [2025-03-04 01:08:39,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f51c712/91cc9253f6784e38928c3009e213c5c3 [2025-03-04 01:08:39,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:08:39,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:08:39,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:08:39,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:08:39,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:08:39,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:08:39" (1/1) ... [2025-03-04 01:08:39,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93dad69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:39, skipping insertion in model container [2025-03-04 01:08:39,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:08:39" (1/1) ... [2025-03-04 01:08:39,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:08:39,964 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-56.i[916,929] [2025-03-04 01:08:40,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:08:40,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:08:40,062 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-56.i[916,929] [2025-03-04 01:08:40,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:08:40,131 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:08:40,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40 WrapperNode [2025-03-04 01:08:40,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:08:40,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:08:40,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:08:40,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:08:40,138 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:08:40" (1/1) ... [2025-03-04 01:08:40,155 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:08:40" (1/1) ... [2025-03-04 01:08:40,195 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 543 [2025-03-04 01:08:40,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:08:40,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:08:40,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:08:40,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:08:40,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,235 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-03-04 01:08:40,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:08:40,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:08:40,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:08:40,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:08:40,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (1/1) ... [2025-03-04 01:08:40,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:08:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:40,304 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:08:40,306 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:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:08:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:08:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:08:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:08:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:08:40,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:08:40,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:08:40,883 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem88#1;havoc property_#t~ite116#1;havoc property_#t~mem104#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem115#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem117#1;havoc property_#t~ite127#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short135#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short138#1;havoc property_#t~ite153#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite150#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem146#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem152#1;havoc property_#t~mem151#1;havoc property_#t~short154#1; [2025-03-04 01:08:40,925 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-03-04 01:08:40,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:08:40,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:08:40,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:08:40,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:08:40 BoogieIcfgContainer [2025-03-04 01:08:40,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:08:40,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:08:40,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:08:40,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:08:40,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:08:39" (1/3) ... [2025-03-04 01:08:40,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a729679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:08:40, skipping insertion in model container [2025-03-04 01:08:40,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:40" (2/3) ... [2025-03-04 01:08:40,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a729679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:08:40, skipping insertion in model container [2025-03-04 01:08:40,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:08:40" (3/3) ... [2025-03-04 01:08:40,945 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2025-03-04 01:08:40,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:08:40,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-56.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:08:40,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:08:41,002 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;@1dec9481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:08:41,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:08:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:08:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:08:41,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:41,016 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:41,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1916318063, now seen corresponding path program 1 times [2025-03-04 01:08:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:08:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417709180] [2025-03-04 01:08:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:41,031 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:08:41,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:08:41,033 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:08:41,035 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:08:41,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:08:41,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:08:41,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:41,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:08:41,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 01:08:41,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:41,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:08:41,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417709180] [2025-03-04 01:08:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417709180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:41,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:08:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374250708] [2025-03-04 01:08:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:08:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:08:41,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:08:41,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:08:41,351 INFO L87 Difference]: Start difference. First operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:41,369 INFO L93 Difference]: Finished difference Result 228 states and 360 transitions. [2025-03-04 01:08:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:08:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-03-04 01:08:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:41,375 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:08:41,375 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:08:41,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:08:41,378 INFO L435 NwaCegarLoop]: 168 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, 168 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:08:41,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:08:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:08:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:08:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2025-03-04 01:08:41,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2025-03-04 01:08:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:41,408 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2025-03-04 01:08:41,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:08:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2025-03-04 01:08:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:08:41,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:41,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:41,419 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:08:41,613 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:08:41,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1254510862, now seen corresponding path program 1 times [2025-03-04 01:08:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:08:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488701097] [2025-03-04 01:08:41,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:41,615 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:08:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:08:41,617 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:08:41,618 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:08:41,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:08:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:08:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:41,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:08:41,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:41,981 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:08:42,667 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 21 treesize of output 17 [2025-03-04 01:08:42,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 01:08:42,760 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 28 treesize of output 16 [2025-03-04 01:08:42,793 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 39 treesize of output 27 [2025-03-04 01:08:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 01:08:42,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:08:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:43,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:08:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488701097] [2025-03-04 01:08:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488701097] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:08:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2025-03-04 01:08:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500600575] [2025-03-04 01:08:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:43,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:08:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:08:43,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:08:43,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:08:43,164 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:43,690 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2025-03-04 01:08:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:08:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-04 01:08:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:43,693 INFO L225 Difference]: With dead ends: 309 [2025-03-04 01:08:43,693 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 01:08:43,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:08:43,697 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:43,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1116 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:08:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 01:08:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-04 01:08:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.4146341463414633) internal successors, (232), 165 states have internal predecessors, (232), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:08:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2025-03-04 01:08:43,713 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 288 transitions. Word has length 149 [2025-03-04 01:08:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:43,714 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 288 transitions. [2025-03-04 01:08:43,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2025-03-04 01:08:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:08:43,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:43,715 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:43,723 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:08:43,916 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:08:43,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -534893699, now seen corresponding path program 1 times [2025-03-04 01:08:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:08:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240592176] [2025-03-04 01:08:43,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:43,917 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:08:43,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:08:43,919 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:08:43,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:08:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:08:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:08:44,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:44,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:44,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:08:44,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:44,130 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:08:44,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-04 01:08:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 01:08:44,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:08:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:44,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:08:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240592176] [2025-03-04 01:08:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240592176] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:08:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2025-03-04 01:08:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335645229] [2025-03-04 01:08:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:08:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:08:44,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:08:44,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:08:44,912 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:45,015 INFO L93 Difference]: Finished difference Result 431 states and 640 transitions. [2025-03-04 01:08:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:08:45,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:08:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:45,019 INFO L225 Difference]: With dead ends: 431 [2025-03-04 01:08:45,019 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 01:08:45,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:08:45,020 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:45,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 653 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:08:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 01:08:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 205. [2025-03-04 01:08:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 174 states have (on average 1.4252873563218391) internal successors, (248), 175 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:08:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2025-03-04 01:08:45,052 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 150 [2025-03-04 01:08:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:45,052 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2025-03-04 01:08:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:08:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2025-03-04 01:08:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:08:45,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:45,057 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:45,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:08:45,258 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:08:45,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:45,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1877098682, now seen corresponding path program 1 times [2025-03-04 01:08:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:08:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003762923] [2025-03-04 01:08:45,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:45,259 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:08:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:08:45,262 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:08:45,263 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:08:45,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:08:45,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:08:45,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:45,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:45,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:08:45,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:45,447 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:08:45,646 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 23 treesize of output 15 [2025-03-04 01:08:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:08:45,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:45,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:08:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003762923] [2025-03-04 01:08:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003762923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:08:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501473443] [2025-03-04 01:08:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:45,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:08:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:08:45,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:08:45,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:45,672 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)