./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.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-sp_file-32.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 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:49:23,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:49:23,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:49:23,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:49:23,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:49:23,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:49:23,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:49:23,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:49:23,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:49:23,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:49:23,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:49:23,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:49:23,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:49:23,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:49:23,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:23,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:49:23,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:49:23,596 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 -> 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 [2025-03-04 01:49:23,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:49:23,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:49:23,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:49:23,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:49:23,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:49:23,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2025-03-04 01:49:24,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8182c887d/b0fc24f1d4e34727a6b600537e956c7b/FLAGb0da4be2c [2025-03-04 01:49:25,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:49:25,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2025-03-04 01:49:25,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8182c887d/b0fc24f1d4e34727a6b600537e956c7b/FLAGb0da4be2c [2025-03-04 01:49:25,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8182c887d/b0fc24f1d4e34727a6b600537e956c7b [2025-03-04 01:49:25,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:49:25,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:49:25,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:25,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:49:25,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:49:25,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25, skipping insertion in model container [2025-03-04 01:49:25,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:49:25,364 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-sp_file-32.i[917,930] [2025-03-04 01:49:25,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:25,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:49:25,447 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-sp_file-32.i[917,930] [2025-03-04 01:49:25,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:25,509 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:49:25,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25 WrapperNode [2025-03-04 01:49:25,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:25,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:25,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:49:25,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:49:25,518 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:49:25" (1/1) ... [2025-03-04 01:49:25,531 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:49:25" (1/1) ... [2025-03-04 01:49:25,571 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2025-03-04 01:49:25,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:25,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:49:25,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:49:25,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:49:25,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,605 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-03-04 01:49:25,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:49:25,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:49:25,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:49:25,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:49:25,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (1/1) ... [2025-03-04 01:49:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:25,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:25,662 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:49:25,664 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:49:25,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:49:25,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:49:25,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:49:25,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:49:25,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:49:25,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:49:25,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:49:25,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:49:25,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:49:26,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-04 01:49:26,142 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:49:26,142 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:49:26,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:49:26,151 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:49:26,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:26 BoogieIcfgContainer [2025-03-04 01:49:26,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:49:26,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:49:26,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:49:26,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:49:26,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:49:25" (1/3) ... [2025-03-04 01:49:26,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c355c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:26, skipping insertion in model container [2025-03-04 01:49:26,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:25" (2/3) ... [2025-03-04 01:49:26,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c355c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:26, skipping insertion in model container [2025-03-04 01:49:26,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:26" (3/3) ... [2025-03-04 01:49:26,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-32.i [2025-03-04 01:49:26,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:49:26,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:49:26,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:49:26,221 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;@6f81ef2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:49:26,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:49:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:49:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:49:26,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:26,232 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:26,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1311769662, now seen corresponding path program 1 times [2025-03-04 01:49:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519991541] [2025-03-04 01:49:26,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:49:26,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:49:26,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:49:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519991541] [2025-03-04 01:49:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519991541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543782874] [2025-03-04 01:49:26,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:26,507 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:49:26,508 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:49:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:49:26,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:49:26,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:26,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:26,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:49:26,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:49:26,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543782874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:26,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:49:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445509389] [2025-03-04 01:49:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:26,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:49:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:26,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:49:26,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:26,707 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:49:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:26,723 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-04 01:49:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:49:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-04 01:49:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:26,731 INFO L225 Difference]: With dead ends: 190 [2025-03-04 01:49:26,731 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:49:26,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:49:26,734 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:26,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:49:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:49:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:49:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-04 01:49:26,761 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-03-04 01:49:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-04 01:49:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:49:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-04 01:49:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:49:26,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:26,763 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,770 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:49:26,970 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:49:26,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 786408876, now seen corresponding path program 1 times [2025-03-04 01:49:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704441359] [2025-03-04 01:49:26,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:26,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:49:27,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:49:27,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:27,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704441359] [2025-03-04 01:49:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704441359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:49:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020362504] [2025-03-04 01:49:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:49:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:27,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:49:27,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:49:27,574 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:49:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:27,782 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2025-03-04 01:49:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:49:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-04 01:49:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:27,784 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:49:27,784 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 01:49:27,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:49:27,785 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 94 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:27,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:49:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 01:49:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2025-03-04 01:49:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 118 states have internal predecessors, (147), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:49:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2025-03-04 01:49:27,808 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 129 [2025-03-04 01:49:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2025-03-04 01:49:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:49:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2025-03-04 01:49:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:49:27,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:27,812 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:49:27,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -153570148, now seen corresponding path program 1 times [2025-03-04 01:49:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:27,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99494866] [2025-03-04 01:49:27,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:49:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:49:27,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:27,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99494866] [2025-03-04 01:49:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99494866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:49:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712021051] [2025-03-04 01:49:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:49:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:29,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:49:29,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:49:29,823 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:49:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:30,689 INFO L93 Difference]: Finished difference Result 312 states and 438 transitions. [2025-03-04 01:49:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:49:30,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 137 [2025-03-04 01:49:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:30,691 INFO L225 Difference]: With dead ends: 312 [2025-03-04 01:49:30,691 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 01:49:30,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:49:30,693 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 297 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:30,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 623 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:49:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 01:49:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 189. [2025-03-04 01:49:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3) internal successors, (195), 150 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:49:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2025-03-04 01:49:30,721 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 137 [2025-03-04 01:49:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:30,721 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2025-03-04 01:49:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:49:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2025-03-04 01:49:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:49:30,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:30,723 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:30,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:49:30,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash -619057181, now seen corresponding path program 1 times [2025-03-04 01:49:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99813837] [2025-03-04 01:49:30,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:49:30,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:49:30,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:30,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:33,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:33,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99813837] [2025-03-04 01:49:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99813837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:33,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:49:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279773625] [2025-03-04 01:49:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:33,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:49:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:33,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:49:33,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:49:33,800 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:49:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:36,037 INFO L93 Difference]: Finished difference Result 431 states and 597 transitions. [2025-03-04 01:49:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:49:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 138 [2025-03-04 01:49:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:36,039 INFO L225 Difference]: With dead ends: 431 [2025-03-04 01:49:36,040 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 01:49:36,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:49:36,043 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 319 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:36,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1315 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:49:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 01:49:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2025-03-04 01:49:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 154 states have internal predecessors, (201), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:49:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2025-03-04 01:49:36,062 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 138 [2025-03-04 01:49:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:36,062 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2025-03-04 01:49:36,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:49:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2025-03-04 01:49:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:49:36,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:36,064 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:49:36,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:36,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800959, now seen corresponding path program 1 times [2025-03-04 01:49:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068924306] [2025-03-04 01:49:36,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:49:36,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:49:36,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068924306] [2025-03-04 01:49:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068924306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:49:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586651938] [2025-03-04 01:49:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:49:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:40,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:49:40,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:49:40,221 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 19 states, 16 states have (on average 3.25) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:49:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:42,875 INFO L93 Difference]: Finished difference Result 521 states and 734 transitions. [2025-03-04 01:49:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:49:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.25) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 139 [2025-03-04 01:49:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:42,877 INFO L225 Difference]: With dead ends: 521 [2025-03-04 01:49:42,877 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 01:49:42,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2025-03-04 01:49:42,879 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 318 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1544 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:49:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 01:49:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 336. [2025-03-04 01:49:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 278 states have (on average 1.3345323741007193) internal successors, (371), 278 states have internal predecessors, (371), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:49:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 479 transitions. [2025-03-04 01:49:42,914 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 479 transitions. Word has length 139 [2025-03-04 01:49:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 479 transitions. [2025-03-04 01:49:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.25) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:49:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 479 transitions. [2025-03-04 01:49:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:49:42,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:42,916 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:49:42,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -545676001, now seen corresponding path program 1 times [2025-03-04 01:49:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071412143] [2025-03-04 01:49:42,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:42,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:49:42,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:49:42,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071412143] [2025-03-04 01:49:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071412143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:49:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510652543] [2025-03-04 01:49:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:49:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:49:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:49:46,193 INFO L87 Difference]: Start difference. First operand 336 states and 479 transitions. Second operand has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:49:54,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:49:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:54,695 INFO L93 Difference]: Finished difference Result 758 states and 1068 transitions. [2025-03-04 01:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:49:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 139 [2025-03-04 01:49:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:54,700 INFO L225 Difference]: With dead ends: 758 [2025-03-04 01:49:54,700 INFO L226 Difference]: Without dead ends: 516 [2025-03-04 01:49:54,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=211, Invalid=978, Unknown=1, NotChecked=0, Total=1190 [2025-03-04 01:49:54,702 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 472 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:54,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 951 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 01:49:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-04 01:49:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 366. [2025-03-04 01:49:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 308 states have (on average 1.344155844155844) internal successors, (414), 308 states have internal predecessors, (414), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:49:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 522 transitions. [2025-03-04 01:49:54,731 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 522 transitions. Word has length 139 [2025-03-04 01:49:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:54,731 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 522 transitions. [2025-03-04 01:49:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:49:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 522 transitions. [2025-03-04 01:49:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:49:54,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:54,732 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:49:54,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:54,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash 981150675, now seen corresponding path program 1 times [2025-03-04 01:49:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679144179] [2025-03-04 01:49:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:54,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:49:54,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:49:54,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:54,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:49:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679144179] [2025-03-04 01:49:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679144179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561812215] [2025-03-04 01:49:54,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:54,833 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:49:54,835 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:49:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:49:54,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:49:54,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:49:54,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:54,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561812215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:49:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509976198] [2025-03-04 01:49:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:49:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:54,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:49:54,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:49:54,986 INFO L87 Difference]: Start difference. First operand 366 states and 522 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:49:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:55,035 INFO L93 Difference]: Finished difference Result 634 states and 905 transitions. [2025-03-04 01:49:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:49:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-04 01:49:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:55,038 INFO L225 Difference]: With dead ends: 634 [2025-03-04 01:49:55,039 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 01:49:55,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:49:55,040 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:55,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 01:49:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-04 01:49:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 314 states have (on average 1.3375796178343948) internal successors, (420), 314 states have internal predecessors, (420), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:49:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 528 transitions. [2025-03-04 01:49:55,073 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 528 transitions. Word has length 139 [2025-03-04 01:49:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 528 transitions. [2025-03-04 01:49:55,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:49:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 528 transitions. [2025-03-04 01:49:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 01:49:55,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:55,076 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:55,082 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:49:55,278 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,SelfDestructingSolverStorable6 [2025-03-04 01:49:55,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:55,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -405225824, now seen corresponding path program 1 times [2025-03-04 01:49:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:55,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981272532] [2025-03-04 01:49:55,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:55,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 01:49:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 01:49:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:55,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:49:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:58,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981272532] [2025-03-04 01:49:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981272532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:49:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364238291] [2025-03-04 01:49:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:49:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:49:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:49:58,495 INFO L87 Difference]: Start difference. First operand 372 states and 528 transitions. Second operand has 17 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 17 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:01,421 INFO L93 Difference]: Finished difference Result 638 states and 891 transitions. [2025-03-04 01:50:01,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:50:01,422 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 17 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 140 [2025-03-04 01:50:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:01,424 INFO L225 Difference]: With dead ends: 638 [2025-03-04 01:50:01,424 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 01:50:01,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:50:01,425 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 278 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:01,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1199 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:50:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 01:50:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 236. [2025-03-04 01:50:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 197 states have (on average 1.3401015228426396) internal successors, (264), 197 states have internal predecessors, (264), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2025-03-04 01:50:01,451 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 140 [2025-03-04 01:50:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:01,451 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2025-03-04 01:50:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 17 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2025-03-04 01:50:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 01:50:01,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:01,453 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:50:01,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 968099744, now seen corresponding path program 1 times [2025-03-04 01:50:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155056166] [2025-03-04 01:50:01,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:01,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 01:50:01,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 01:50:01,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:01,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155056166] [2025-03-04 01:50:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155056166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:02,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:50:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900476281] [2025-03-04 01:50:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:50:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:02,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:50:02,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:50:02,226 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:50:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:02,935 INFO L93 Difference]: Finished difference Result 424 states and 599 transitions. [2025-03-04 01:50:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:50:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-04 01:50:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:02,937 INFO L225 Difference]: With dead ends: 424 [2025-03-04 01:50:02,937 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 01:50:02,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:50:02,938 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 403 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:02,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 469 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 01:50:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 226. [2025-03-04 01:50:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.3315508021390374) internal successors, (249), 187 states have internal predecessors, (249), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2025-03-04 01:50:02,958 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 140 [2025-03-04 01:50:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:02,958 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2025-03-04 01:50:02,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:50:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2025-03-04 01:50:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 01:50:02,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:02,959 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:50:02,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1202115930, now seen corresponding path program 1 times [2025-03-04 01:50:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:02,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371988811] [2025-03-04 01:50:02,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:02,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 01:50:02,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 01:50:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371988811] [2025-03-04 01:50:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371988811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:06,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:06,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:50:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977630084] [2025-03-04 01:50:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:06,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:50:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:06,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:50:06,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:50:06,327 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:50:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:07,968 INFO L93 Difference]: Finished difference Result 395 states and 557 transitions. [2025-03-04 01:50:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:50:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 140 [2025-03-04 01:50:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:07,970 INFO L225 Difference]: With dead ends: 395 [2025-03-04 01:50:07,970 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 01:50:07,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:50:07,971 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 321 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:07,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 584 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:50:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 01:50:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 207. [2025-03-04 01:50:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 168 states have internal predecessors, (220), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 292 transitions. [2025-03-04 01:50:07,995 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 292 transitions. Word has length 140 [2025-03-04 01:50:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:07,995 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 292 transitions. [2025-03-04 01:50:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:50:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 292 transitions. [2025-03-04 01:50:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:50:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:07,996 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:50:07,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1788128770, now seen corresponding path program 1 times [2025-03-04 01:50:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746242450] [2025-03-04 01:50:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:50:08,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:50:08,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:10,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746242450] [2025-03-04 01:50:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746242450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-04 01:50:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429327143] [2025-03-04 01:50:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:50:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:50:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:50:10,109 INFO L87 Difference]: Start difference. First operand 207 states and 292 transitions. Second operand has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:12,443 INFO L93 Difference]: Finished difference Result 444 states and 618 transitions. [2025-03-04 01:50:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:50:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 141 [2025-03-04 01:50:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:12,445 INFO L225 Difference]: With dead ends: 444 [2025-03-04 01:50:12,445 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 01:50:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:50:12,446 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 247 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:12,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1326 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:50:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 01:50:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 228. [2025-03-04 01:50:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 189 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2025-03-04 01:50:12,476 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 141 [2025-03-04 01:50:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:12,477 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2025-03-04 01:50:12,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2025-03-04 01:50:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:50:12,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:12,481 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:50:12,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 280515349, now seen corresponding path program 1 times [2025-03-04 01:50:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880348843] [2025-03-04 01:50:12,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:12,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:50:12,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:50:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880348843] [2025-03-04 01:50:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880348843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:14,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:50:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764769241] [2025-03-04 01:50:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:50:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:14,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:50:14,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:50:14,572 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:50:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:15,554 INFO L93 Difference]: Finished difference Result 430 states and 604 transitions. [2025-03-04 01:50:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:50:15,555 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 141 [2025-03-04 01:50:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:15,556 INFO L225 Difference]: With dead ends: 430 [2025-03-04 01:50:15,556 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:50:15,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:50:15,557 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 447 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:15,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 396 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:50:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:50:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 267. [2025-03-04 01:50:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 228 states have (on average 1.337719298245614) internal successors, (305), 228 states have internal predecessors, (305), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-03-04 01:50:15,581 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 141 [2025-03-04 01:50:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:15,582 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-03-04 01:50:15,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:50:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-03-04 01:50:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:50:15,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:15,583 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:50:15,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:15,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1747853127, now seen corresponding path program 1 times [2025-03-04 01:50:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868497889] [2025-03-04 01:50:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:50:15,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:50:15,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:15,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868497889] [2025-03-04 01:50:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868497889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:50:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68115725] [2025-03-04 01:50:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:16,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:50:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:16,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:50:16,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:50:16,368 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:16,931 INFO L93 Difference]: Finished difference Result 357 states and 485 transitions. [2025-03-04 01:50:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:50:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-03-04 01:50:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:16,933 INFO L225 Difference]: With dead ends: 357 [2025-03-04 01:50:16,933 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 01:50:16,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:50:16,933 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 177 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 499 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 01:50:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 340. [2025-03-04 01:50:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 301 states have (on average 1.3056478405315615) internal successors, (393), 301 states have internal predecessors, (393), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 465 transitions. [2025-03-04 01:50:16,967 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 465 transitions. Word has length 141 [2025-03-04 01:50:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 465 transitions. [2025-03-04 01:50:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 465 transitions. [2025-03-04 01:50:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:50:16,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:16,970 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:16,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:50:16,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:16,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1868612061, now seen corresponding path program 1 times [2025-03-04 01:50:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:16,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548830812] [2025-03-04 01:50:16,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:16,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:16,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:50:17,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:50:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:17,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548830812] [2025-03-04 01:50:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548830812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:50:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37662458] [2025-03-04 01:50:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:19,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:50:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:19,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:50:19,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:50:19,299 INFO L87 Difference]: Start difference. First operand 340 states and 465 transitions. Second operand has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:21,010 INFO L93 Difference]: Finished difference Result 651 states and 876 transitions. [2025-03-04 01:50:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:50:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-03-04 01:50:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:21,012 INFO L225 Difference]: With dead ends: 651 [2025-03-04 01:50:21,012 INFO L226 Difference]: Without dead ends: 413 [2025-03-04 01:50:21,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:50:21,013 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 203 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1054 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:50:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-04 01:50:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 344. [2025-03-04 01:50:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 469 transitions. [2025-03-04 01:50:21,036 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 469 transitions. Word has length 142 [2025-03-04 01:50:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:21,038 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 469 transitions. [2025-03-04 01:50:21,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 469 transitions. [2025-03-04 01:50:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:50:21,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:21,039 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:50:21,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 801936092, now seen corresponding path program 1 times [2025-03-04 01:50:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912938979] [2025-03-04 01:50:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:50:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:50:21,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912938979] [2025-03-04 01:50:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912938979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:50:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003903634] [2025-03-04 01:50:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:22,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:50:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:22,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:50:22,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:50:22,005 INFO L87 Difference]: Start difference. First operand 344 states and 469 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:22,829 INFO L93 Difference]: Finished difference Result 725 states and 980 transitions. [2025-03-04 01:50:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:50:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-03-04 01:50:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:22,831 INFO L225 Difference]: With dead ends: 725 [2025-03-04 01:50:22,831 INFO L226 Difference]: Without dead ends: 483 [2025-03-04 01:50:22,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:50:22,832 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 401 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:22,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 715 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:50:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-04 01:50:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 438. [2025-03-04 01:50:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 399 states have (on average 1.3157894736842106) internal successors, (525), 399 states have internal predecessors, (525), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:50:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2025-03-04 01:50:22,861 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 142 [2025-03-04 01:50:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:22,861 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2025-03-04 01:50:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2025-03-04 01:50:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:50:22,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:22,862 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:22,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:50:22,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:22,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 646521203, now seen corresponding path program 1 times [2025-03-04 01:50:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436665439] [2025-03-04 01:50:22,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:22,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:50:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:50:22,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:22,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436665439] [2025-03-04 01:50:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436665439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:50:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872943726] [2025-03-04 01:50:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:50:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:23,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:50:23,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:50:23,524 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:24,066 INFO L93 Difference]: Finished difference Result 913 states and 1234 transitions. [2025-03-04 01:50:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:50:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 143 [2025-03-04 01:50:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:24,070 INFO L225 Difference]: With dead ends: 913 [2025-03-04 01:50:24,070 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 01:50:24,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:50:24,072 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 386 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:24,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 399 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 01:50:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 594. [2025-03-04 01:50:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 543 states have (on average 1.3093922651933703) internal successors, (711), 544 states have internal predecessors, (711), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:50:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 803 transitions. [2025-03-04 01:50:24,112 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 803 transitions. Word has length 143 [2025-03-04 01:50:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 803 transitions. [2025-03-04 01:50:24,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 803 transitions. [2025-03-04 01:50:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:50:24,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:24,114 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:50:24,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 435170290, now seen corresponding path program 1 times [2025-03-04 01:50:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531983809] [2025-03-04 01:50:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:50:24,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:50:24,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531983809] [2025-03-04 01:50:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531983809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:50:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337074836] [2025-03-04 01:50:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:24,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:50:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:24,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:50:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:50:24,425 INFO L87 Difference]: Start difference. First operand 594 states and 803 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:50:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:24,710 INFO L93 Difference]: Finished difference Result 1081 states and 1453 transitions. [2025-03-04 01:50:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:50:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-04 01:50:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:24,715 INFO L225 Difference]: With dead ends: 1081 [2025-03-04 01:50:24,715 INFO L226 Difference]: Without dead ends: 633 [2025-03-04 01:50:24,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:50:24,716 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 177 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:24,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 370 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:50:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-04 01:50:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 594. [2025-03-04 01:50:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 543 states have (on average 1.3057090239410682) internal successors, (709), 544 states have internal predecessors, (709), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:50:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 801 transitions. [2025-03-04 01:50:24,756 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 801 transitions. Word has length 143 [2025-03-04 01:50:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:24,756 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 801 transitions. [2025-03-04 01:50:24,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:50:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 801 transitions. [2025-03-04 01:50:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:50:24,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:24,757 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:50:24,757 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1403197884, now seen corresponding path program 1 times [2025-03-04 01:50:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080531262] [2025-03-04 01:50:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:24,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:50:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:50:24,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080531262] [2025-03-04 01:50:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080531262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 01:50:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991922714] [2025-03-04 01:50:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:29,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 01:50:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:29,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 01:50:29,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:50:29,259 INFO L87 Difference]: Start difference. First operand 594 states and 801 transitions. Second operand has 23 states, 20 states have (on average 2.8) internal successors, (56), 23 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 01:50:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:34,634 INFO L93 Difference]: Finished difference Result 1504 states and 1993 transitions. [2025-03-04 01:50:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:50:34,634 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.8) internal successors, (56), 23 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 7 states have call successors, (18) Word has length 143 [2025-03-04 01:50:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:34,637 INFO L225 Difference]: With dead ends: 1504 [2025-03-04 01:50:34,637 INFO L226 Difference]: Without dead ends: 1056 [2025-03-04 01:50:34,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=350, Invalid=1542, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 01:50:34,639 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 457 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:34,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1734 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 01:50:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-04 01:50:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 901. [2025-03-04 01:50:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 820 states have (on average 1.2951219512195122) internal successors, (1062), 822 states have internal predecessors, (1062), 74 states have call successors, (74), 6 states have call predecessors, (74), 6 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:50:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1210 transitions. [2025-03-04 01:50:34,708 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1210 transitions. Word has length 143 [2025-03-04 01:50:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:34,708 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1210 transitions. [2025-03-04 01:50:34,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.8) internal successors, (56), 23 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 01:50:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1210 transitions. [2025-03-04 01:50:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:50:34,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:34,709 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:50:34,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:34,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1465929803, now seen corresponding path program 1 times [2025-03-04 01:50:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906532841] [2025-03-04 01:50:34,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:34,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:50:34,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:50:34,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:34,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906532841] [2025-03-04 01:50:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906532841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 01:50:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097291464] [2025-03-04 01:50:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:37,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:50:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:50:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:50:37,218 INFO L87 Difference]: Start difference. First operand 901 states and 1210 transitions. Second operand has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:39,258 INFO L93 Difference]: Finished difference Result 2096 states and 2760 transitions. [2025-03-04 01:50:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:50:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 144 [2025-03-04 01:50:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:39,263 INFO L225 Difference]: With dead ends: 2096 [2025-03-04 01:50:39,263 INFO L226 Difference]: Without dead ends: 1343 [2025-03-04 01:50:39,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:50:39,265 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 540 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:39,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1044 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:50:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-03-04 01:50:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 662. [2025-03-04 01:50:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 611 states have (on average 1.2913256955810146) internal successors, (789), 612 states have internal predecessors, (789), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:50:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 881 transitions. [2025-03-04 01:50:39,314 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 881 transitions. Word has length 144 [2025-03-04 01:50:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:39,315 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 881 transitions. [2025-03-04 01:50:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:50:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 881 transitions. [2025-03-04 01:50:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:50:39,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:39,316 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:50:39,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1337386401, now seen corresponding path program 1 times [2025-03-04 01:50:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387212948] [2025-03-04 01:50:39,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:50:39,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:50:39,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:39,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:39,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387212948] [2025-03-04 01:50:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387212948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:39,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:50:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972938746] [2025-03-04 01:50:39,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:39,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:50:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:39,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:50:39,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:50:39,942 INFO L87 Difference]: Start difference. First operand 662 states and 881 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:40,507 INFO L93 Difference]: Finished difference Result 1229 states and 1628 transitions. [2025-03-04 01:50:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:50:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-04 01:50:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:40,510 INFO L225 Difference]: With dead ends: 1229 [2025-03-04 01:50:40,510 INFO L226 Difference]: Without dead ends: 721 [2025-03-04 01:50:40,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:50:40,511 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 197 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:40,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 429 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-04 01:50:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 662. [2025-03-04 01:50:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 611 states have (on average 1.286415711947627) internal successors, (786), 612 states have internal predecessors, (786), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:50:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 878 transitions. [2025-03-04 01:50:40,560 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 878 transitions. Word has length 144 [2025-03-04 01:50:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:40,560 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 878 transitions. [2025-03-04 01:50:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 878 transitions. [2025-03-04 01:50:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:50:40,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:40,562 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:40,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:50:40,562 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:40,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 667856171, now seen corresponding path program 1 times [2025-03-04 01:50:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411321330] [2025-03-04 01:50:40,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:40,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:50:40,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:50:40,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:40,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411321330] [2025-03-04 01:50:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411321330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:41,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:41,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:50:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115328812] [2025-03-04 01:50:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:41,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:50:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:41,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:50:41,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:50:41,984 INFO L87 Difference]: Start difference. First operand 662 states and 878 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:50:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:44,030 INFO L93 Difference]: Finished difference Result 1331 states and 1734 transitions. [2025-03-04 01:50:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:50:44,030 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-04 01:50:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:44,033 INFO L225 Difference]: With dead ends: 1331 [2025-03-04 01:50:44,033 INFO L226 Difference]: Without dead ends: 823 [2025-03-04 01:50:44,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:50:44,035 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 516 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:44,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1132 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:50:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-04 01:50:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 638. [2025-03-04 01:50:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 583 states have (on average 1.2864493996569468) internal successors, (750), 585 states have internal predecessors, (750), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:50:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 846 transitions. [2025-03-04 01:50:44,089 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 846 transitions. Word has length 144 [2025-03-04 01:50:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 846 transitions. [2025-03-04 01:50:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:50:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 846 transitions. [2025-03-04 01:50:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:50:44,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:44,090 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:50:44,090 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -367239370, now seen corresponding path program 1 times [2025-03-04 01:50:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218430658] [2025-03-04 01:50:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:44,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:50:44,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:50:44,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:44,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:50:44,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:44,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218430658] [2025-03-04 01:50:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218430658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:50:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670813770] [2025-03-04 01:50:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:44,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:50:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:50:44,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:50:44,588 INFO L87 Difference]: Start difference. First operand 638 states and 846 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:45,124 INFO L93 Difference]: Finished difference Result 1193 states and 1570 transitions. [2025-03-04 01:50:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:50:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-04 01:50:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:45,128 INFO L225 Difference]: With dead ends: 1193 [2025-03-04 01:50:45,128 INFO L226 Difference]: Without dead ends: 705 [2025-03-04 01:50:45,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:50:45,131 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 247 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:45,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 387 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-04 01:50:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 702. [2025-03-04 01:50:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 632 states have (on average 1.2721518987341771) internal successors, (804), 635 states have internal predecessors, (804), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:50:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 924 transitions. [2025-03-04 01:50:45,204 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 924 transitions. Word has length 145 [2025-03-04 01:50:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:45,204 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 924 transitions. [2025-03-04 01:50:45,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:50:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 924 transitions. [2025-03-04 01:50:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:50:45,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:45,205 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:50:45,206 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:45,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -563752875, now seen corresponding path program 1 times [2025-03-04 01:50:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:45,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005955357] [2025-03-04 01:50:45,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:50:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:50:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:50:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005955357] [2025-03-04 01:50:45,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005955357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781286727] [2025-03-04 01:50:45,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:45,328 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:50:45,330 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:50:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.