./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.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-ap_file-19.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 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:14:00,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:14:00,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:14:00,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:14:00,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:14:00,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:14:00,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:14:00,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:14:00,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:14:00,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:14:00,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:14:00,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:14:00,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:14:00,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:14:00,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:14:00,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:14:00,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:14:00,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:14:00,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:14:00,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:14:00,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:14:00,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:14:00,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:14:00,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:14:00,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:14:00,130 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 -> 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 [2025-03-04 01:14:00,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:14:00,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:14:00,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:14:00,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:14:00,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:14:00,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-04 01:14:01,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad7454be/10cdd489a2fe40a69eb343cf48ab6478/FLAG7c822b16d [2025-03-04 01:14:01,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:14:01,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-04 01:14:01,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad7454be/10cdd489a2fe40a69eb343cf48ab6478/FLAG7c822b16d [2025-03-04 01:14:02,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad7454be/10cdd489a2fe40a69eb343cf48ab6478 [2025-03-04 01:14:02,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:14:02,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:14:02,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:14:02,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:14:02,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:14:02,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02, skipping insertion in model container [2025-03-04 01:14:02,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:14:02,199 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-ap_file-19.i[917,930] [2025-03-04 01:14:02,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:14:02,268 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:14:02,276 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-ap_file-19.i[917,930] [2025-03-04 01:14:02,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:14:02,318 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:14:02,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02 WrapperNode [2025-03-04 01:14:02,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:14:02,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:14:02,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:14:02,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:14:02,324 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:14:02" (1/1) ... [2025-03-04 01:14:02,332 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:14:02" (1/1) ... [2025-03-04 01:14:02,358 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-03-04 01:14:02,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:14:02,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:14:02,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:14:02,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:14:02,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,396 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2025-03-04 01:14:02,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:14:02,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:14:02,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:14:02,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:14:02,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (1/1) ... [2025-03-04 01:14:02,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:14:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:02,451 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:14:02,455 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:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:14:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:14:02,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:14:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:14:02,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:14:02,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:14:02,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:14:02,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-04 01:14:02,937 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:14:02,937 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:14:02,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:14:02,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:14:02,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:14:02 BoogieIcfgContainer [2025-03-04 01:14:02,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:14:02,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:14:02,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:14:02,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:14:02,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:14:02" (1/3) ... [2025-03-04 01:14:02,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f6653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:14:02, skipping insertion in model container [2025-03-04 01:14:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:02" (2/3) ... [2025-03-04 01:14:02,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f6653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:14:02, skipping insertion in model container [2025-03-04 01:14:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:14:02" (3/3) ... [2025-03-04 01:14:02,960 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-04 01:14:02,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:14:02,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:14:03,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:14:03,027 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;@8d07c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:14:03,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:14:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:14:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:14:03,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:03,041 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:03,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1542436912, now seen corresponding path program 1 times [2025-03-04 01:14:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:03,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244955112] [2025-03-04 01:14:03,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:03,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:03,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:03,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:03,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:14:03,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:03,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244955112] [2025-03-04 01:14:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244955112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131379455] [2025-03-04 01:14:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:03,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:03,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:03,285 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:14:03,286 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:14:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:03,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:03,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:14:03,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:14:03,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:03,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131379455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:03,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:03,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:14:03,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281842743] [2025-03-04 01:14:03,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:14:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:03,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:14:03,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:14:03,537 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:14:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:03,559 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-04 01:14:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:14:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-04 01:14:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:03,565 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:14:03,565 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:14:03,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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:14:03,572 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:03,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:14:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:14:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:14:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-03-04 01:14:03,606 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-03-04 01:14:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:03,606 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-03-04 01:14:03,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:14:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-03-04 01:14:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:14:03,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:03,611 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,618 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:14:03,812 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:14:03,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1345416801, now seen corresponding path program 1 times [2025-03-04 01:14:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-04 01:14:03,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:03,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:03,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-04 01:14:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84288328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:04,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:04,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:14:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534262097] [2025-03-04 01:14:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:14:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:04,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:14:04,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:14:04,100 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:04,144 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-04 01:14:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:14:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:14:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:04,146 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:14:04,146 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:14:04,146 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:14:04,147 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:04,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:14:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:14:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:14:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-03-04 01:14:04,165 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-03-04 01:14:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-03-04 01:14:04,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-03-04 01:14:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:14:04,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:04,167 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:04,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:14:04,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1346340322, now seen corresponding path program 1 times [2025-03-04 01:14:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199253262] [2025-03-04 01:14:04,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:04,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:04,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:14:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199253262] [2025-03-04 01:14:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199253262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494086720] [2025-03-04 01:14:05,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:05,663 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:14:05,664 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:14:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:05,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:05,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:05,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:05,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:14:05,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:05,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:06,120 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 195 treesize of output 171 [2025-03-04 01:14:06,127 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 171 treesize of output 115 [2025-03-04 01:14:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:14:06,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494086720] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:14:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 8] total 20 [2025-03-04 01:14:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048656422] [2025-03-04 01:14:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:06,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:06,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:14:06,404 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:06,646 INFO L93 Difference]: Finished difference Result 250 states and 349 transitions. [2025-03-04 01:14:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:14:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:14:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:06,648 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:14:06,648 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 01:14:06,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:14:06,650 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:06,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 657 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 01:14:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-03-04 01:14:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.3203125) internal successors, (169), 129 states have internal predecessors, (169), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:14:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2025-03-04 01:14:06,664 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 132 [2025-03-04 01:14:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:06,665 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2025-03-04 01:14:06,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2025-03-04 01:14:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:14:06,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:06,669 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:14:06,869 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,SelfDestructingSolverStorable2 [2025-03-04 01:14:06,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1595317277, now seen corresponding path program 1 times [2025-03-04 01:14:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412795765] [2025-03-04 01:14:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:06,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:14:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:14:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412795765] [2025-03-04 01:14:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412795765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622609330] [2025-03-04 01:14:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:07,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:07,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:07,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:14:07,064 INFO L87 Difference]: Start difference. First operand 150 states and 207 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:07,123 INFO L93 Difference]: Finished difference Result 339 states and 467 transitions. [2025-03-04 01:14:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:14:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:07,127 INFO L225 Difference]: With dead ends: 339 [2025-03-04 01:14:07,127 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 01:14:07,128 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:14:07,129 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 47 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:07,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 652 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 01:14:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2025-03-04 01:14:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 135 states have internal predecessors, (177), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:14:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2025-03-04 01:14:07,139 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 132 [2025-03-04 01:14:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2025-03-04 01:14:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2025-03-04 01:14:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:14:07,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:07,144 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:14:07,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:07,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -294489052, now seen corresponding path program 1 times [2025-03-04 01:14:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086299] [2025-03-04 01:14:07,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:07,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:14:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:14:07,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086299] [2025-03-04 01:14:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316086299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400317483] [2025-03-04 01:14:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:07,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:07,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:07,565 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:07,871 INFO L93 Difference]: Finished difference Result 402 states and 548 transitions. [2025-03-04 01:14:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:14:07,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-04 01:14:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:07,873 INFO L225 Difference]: With dead ends: 402 [2025-03-04 01:14:07,873 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 01:14:07,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:07,874 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 68 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 882 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 01:14:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2025-03-04 01:14:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 217 states have internal predecessors, (278), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:14:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2025-03-04 01:14:07,889 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 133 [2025-03-04 01:14:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:07,890 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2025-03-04 01:14:07,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2025-03-04 01:14:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:14:07,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:07,891 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:14:07,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash 183011265, now seen corresponding path program 1 times [2025-03-04 01:14:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545877336] [2025-03-04 01:14:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:14:07,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:14:07,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:08,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545877336] [2025-03-04 01:14:08,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545877336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:08,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:08,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796010005] [2025-03-04 01:14:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:08,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:08,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:08,316 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:08,739 INFO L93 Difference]: Finished difference Result 699 states and 938 transitions. [2025-03-04 01:14:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-04 01:14:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:08,745 INFO L225 Difference]: With dead ends: 699 [2025-03-04 01:14:08,745 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 01:14:08,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:08,746 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 89 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:08,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1222 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 01:14:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 285. [2025-03-04 01:14:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.3201581027667983) internal successors, (334), 256 states have internal predecessors, (334), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:14:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2025-03-04 01:14:08,778 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 134 [2025-03-04 01:14:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2025-03-04 01:14:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2025-03-04 01:14:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:14:08,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:08,781 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:14:08,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash 984570047, now seen corresponding path program 1 times [2025-03-04 01:14:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-03-04 01:14:08,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:08,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:14:08,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:14:08,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:08,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-03-04 01:14:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608491475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:09,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:09,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6075174] [2025-03-04 01:14:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:09,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:09,328 INFO L87 Difference]: Start difference. First operand 285 states and 388 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:09,618 INFO L93 Difference]: Finished difference Result 675 states and 915 transitions. [2025-03-04 01:14:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-04 01:14:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:09,621 INFO L225 Difference]: With dead ends: 675 [2025-03-04 01:14:09,621 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 01:14:09,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:09,622 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 92 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:09,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 857 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 01:14:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-03-04 01:14:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 344 states have (on average 1.2994186046511629) internal successors, (447), 349 states have internal predecessors, (447), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:14:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 523 transitions. [2025-03-04 01:14:09,647 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 523 transitions. Word has length 134 [2025-03-04 01:14:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:09,647 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 523 transitions. [2025-03-04 01:14:09,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 523 transitions. [2025-03-04 01:14:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:09,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:09,649 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:09,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:14:09,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1997951451, now seen corresponding path program 1 times [2025-03-04 01:14:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503099165] [2025-03-04 01:14:09,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:09,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:09,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:09,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:09,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:14:10,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:10,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503099165] [2025-03-04 01:14:10,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503099165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:10,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505537784] [2025-03-04 01:14:10,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:10,084 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:14:10,086 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:14:10,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:10,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:10,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:10,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:10,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:14:10,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:10,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:10,394 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 27 treesize of output 11 [2025-03-04 01:14:10,496 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 15 treesize of output 7 [2025-03-04 01:14:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 211 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 01:14:10,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505537784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:10,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:14:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-04 01:14:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002582682] [2025-03-04 01:14:10,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:14:10,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:14:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:10,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:14:10,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:14:10,645 INFO L87 Difference]: Start difference. First operand 390 states and 523 transitions. Second operand has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 01:14:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:11,150 INFO L93 Difference]: Finished difference Result 879 states and 1165 transitions. [2025-03-04 01:14:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:14:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 135 [2025-03-04 01:14:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:11,153 INFO L225 Difference]: With dead ends: 879 [2025-03-04 01:14:11,153 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 01:14:11,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:14:11,154 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 368 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:11,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 751 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 01:14:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 469. [2025-03-04 01:14:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 416 states have (on average 1.2908653846153846) internal successors, (537), 423 states have internal predecessors, (537), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 35 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 621 transitions. [2025-03-04 01:14:11,197 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 621 transitions. Word has length 135 [2025-03-04 01:14:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 621 transitions. [2025-03-04 01:14:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 01:14:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 621 transitions. [2025-03-04 01:14:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:11,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:11,199 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:11,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1888191620, now seen corresponding path program 1 times [2025-03-04 01:14:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-04 01:14:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:11,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:11,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:11,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:11,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-04 01:14:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723497505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:11,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503583343] [2025-03-04 01:14:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:11,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:11,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:11,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:11,805 INFO L87 Difference]: Start difference. First operand 469 states and 621 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:14:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:12,038 INFO L93 Difference]: Finished difference Result 956 states and 1258 transitions. [2025-03-04 01:14:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-04 01:14:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:12,040 INFO L225 Difference]: With dead ends: 956 [2025-03-04 01:14:12,040 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 01:14:12,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:12,042 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 315 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:12,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 380 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 01:14:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 403. [2025-03-04 01:14:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 354 states have (on average 1.2824858757062148) internal successors, (454), 359 states have internal predecessors, (454), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:14:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 530 transitions. [2025-03-04 01:14:12,081 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 530 transitions. Word has length 135 [2025-03-04 01:14:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:12,081 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 530 transitions. [2025-03-04 01:14:12,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:14:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 530 transitions. [2025-03-04 01:14:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:12,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:12,084 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:14:12,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1594788613, now seen corresponding path program 1 times [2025-03-04 01:14:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-04 01:14:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-04 01:14:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61996956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:14:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949987731] [2025-03-04 01:14:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:14:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:12,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:14:12,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:12,789 INFO L87 Difference]: Start difference. First operand 403 states and 530 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:13,235 INFO L93 Difference]: Finished difference Result 913 states and 1197 transitions. [2025-03-04 01:14:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:14:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-04 01:14:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:13,241 INFO L225 Difference]: With dead ends: 913 [2025-03-04 01:14:13,241 INFO L226 Difference]: Without dead ends: 513 [2025-03-04 01:14:13,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:14:13,242 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 64 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:13,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1462 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-04 01:14:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 423. [2025-03-04 01:14:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 374 states have (on average 1.2807486631016043) internal successors, (479), 379 states have internal predecessors, (479), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:14:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 555 transitions. [2025-03-04 01:14:13,278 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 555 transitions. Word has length 135 [2025-03-04 01:14:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:13,281 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 555 transitions. [2025-03-04 01:14:13,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 555 transitions. [2025-03-04 01:14:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:13,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:13,282 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:14:13,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -420492590, now seen corresponding path program 1 times [2025-03-04 01:14:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602394550] [2025-03-04 01:14:13,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:13,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:13,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:13,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:14:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602394550] [2025-03-04 01:14:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602394550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168752014] [2025-03-04 01:14:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:13,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:13,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:13,915 INFO L87 Difference]: Start difference. First operand 423 states and 555 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:14,916 INFO L93 Difference]: Finished difference Result 1408 states and 1823 transitions. [2025-03-04 01:14:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:14:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-04 01:14:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:14,922 INFO L225 Difference]: With dead ends: 1408 [2025-03-04 01:14:14,923 INFO L226 Difference]: Without dead ends: 988 [2025-03-04 01:14:14,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:14:14,926 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 329 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:14,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1103 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:14:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-04 01:14:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 703. [2025-03-04 01:14:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 623 states have (on average 1.274478330658106) internal successors, (794), 631 states have internal predecessors, (794), 59 states have call successors, (59), 20 states have call predecessors, (59), 20 states have return successors, (59), 51 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 01:14:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 912 transitions. [2025-03-04 01:14:15,009 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 912 transitions. Word has length 135 [2025-03-04 01:14:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:15,009 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 912 transitions. [2025-03-04 01:14:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:14:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 912 transitions. [2025-03-04 01:14:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:15,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:15,012 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:14:15,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:15,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1474199463, now seen corresponding path program 1 times [2025-03-04 01:14:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:15,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038463581] [2025-03-04 01:14:15,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:15,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:15,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:15,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:15,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:14:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038463581] [2025-03-04 01:14:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038463581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506079907] [2025-03-04 01:14:15,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:15,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:15,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:15,525 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:14:15,526 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:14:15,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:15,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:15,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:15,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:15,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:14:15,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:15,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:15,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:14:16,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:16,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:14:16,457 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 15 treesize of output 7 [2025-03-04 01:14:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 211 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 01:14:16,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506079907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:16,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:14:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-04 01:14:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543390464] [2025-03-04 01:14:16,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:14:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:14:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:16,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:14:16,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:14:16,552 INFO L87 Difference]: Start difference. First operand 703 states and 912 transitions. Second operand has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 17 states have internal predecessors, (100), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2025-03-04 01:14:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:17,175 INFO L93 Difference]: Finished difference Result 1423 states and 1841 transitions. [2025-03-04 01:14:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:14:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 17 states have internal predecessors, (100), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 135 [2025-03-04 01:14:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:17,179 INFO L225 Difference]: With dead ends: 1423 [2025-03-04 01:14:17,179 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 01:14:17,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:14:17,181 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 523 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:17,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 513 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 01:14:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 701. [2025-03-04 01:14:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 621 states have (on average 1.2673107890499196) internal successors, (787), 629 states have internal predecessors, (787), 59 states have call successors, (59), 20 states have call predecessors, (59), 20 states have return successors, (59), 51 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 01:14:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 905 transitions. [2025-03-04 01:14:17,232 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 905 transitions. Word has length 135 [2025-03-04 01:14:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:17,232 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 905 transitions. [2025-03-04 01:14:17,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 17 states have internal predecessors, (100), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2025-03-04 01:14:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 905 transitions. [2025-03-04 01:14:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:14:17,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:17,234 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:17,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:17,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:17,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:17,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1767602470, now seen corresponding path program 1 times [2025-03-04 01:14:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577942841] [2025-03-04 01:14:17,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:17,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:17,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:17,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:17,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:14:17,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577515692] [2025-03-04 01:14:17,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:17,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:17,527 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:14:17,528 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:14:17,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:14:17,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:14:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:17,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-03-04 01:14:17,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:19,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:20,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-03-04 01:14:21,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:21,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2025-03-04 01:14:22,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:14:23,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 01:14:25,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:26,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2025-03-04 01:14:26,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,936 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 01:14:26,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 74 [2025-03-04 01:14:30,618 INFO L349 Elim1Store]: treesize reduction 156, result has 63.0 percent of original size [2025-03-04 01:14:30,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 390