./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:48:00,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:48:00,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:48:00,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:48:00,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:48:00,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:48:00,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:48:00,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:48:00,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:48:00,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:48:00,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:48:00,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:48:00,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:48:00,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:48:00,238 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:48:00,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:48:00,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:48:00,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:48:00,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:48:00,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:00,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:48:00,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:48:00,241 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-jdk21/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 -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-02-06 03:48:00,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:48:00,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:48:00,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:48:00,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:48:00,484 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:48:00,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:48:01,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98c91e950/0707171426e74dd693f521c28e287955/FLAG0fb03e7e6 [2025-02-06 03:48:01,895 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:48:01,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:48:01,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98c91e950/0707171426e74dd693f521c28e287955/FLAG0fb03e7e6 [2025-02-06 03:48:02,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98c91e950/0707171426e74dd693f521c28e287955 [2025-02-06 03:48:02,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:48:02,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:48:02,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:02,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:48:02,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:48:02,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02, skipping insertion in model container [2025-02-06 03:48:02,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:48:02,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-02-06 03:48:02,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:02,399 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:48:02,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-02-06 03:48:02,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:02,451 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:48:02,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02 WrapperNode [2025-02-06 03:48:02,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:02,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:02,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:48:02,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:48:02,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,491 INFO L138 Inliner]: procedures = 30, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-02-06 03:48:02,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:02,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:48:02,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:48:02,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:48:02,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,510 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:48:02,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:48:02,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:48:02,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:48:02,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:48:02,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (1/1) ... [2025-02-06 03:48:02,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:02,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:02,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:48:02,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:48:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:48:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:48:02,670 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:48:02,672 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:48:02,997 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-02-06 03:48:03,030 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-02-06 03:48:03,031 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:48:03,043 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:48:03,043 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:48:03,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:03 BoogieIcfgContainer [2025-02-06 03:48:03,043 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:48:03,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:48:03,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:48:03,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:48:03,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:48:02" (1/3) ... [2025-02-06 03:48:03,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fb4ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:03, skipping insertion in model container [2025-02-06 03:48:03,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:02" (2/3) ... [2025-02-06 03:48:03,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fb4ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:03, skipping insertion in model container [2025-02-06 03:48:03,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:03" (3/3) ... [2025-02-06 03:48:03,053 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:48:03,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:48:03,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:48:03,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:48:03,125 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;@17326253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:48:03,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:48:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:48:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:48:03,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:03,141 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:03,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash 658067197, now seen corresponding path program 1 times [2025-02-06 03:48:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633243406] [2025-02-06 03:48:03,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:48:03,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:48:03,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:03,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:48:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633243406] [2025-02-06 03:48:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633243406] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36791754] [2025-02-06 03:48:03,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:03,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:03,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:03,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:03,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:48:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:48:03,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:48:03,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:03,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:03,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:48:03,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:48:03,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36791754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:48:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755623211] [2025-02-06 03:48:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:03,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:48:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:48:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:48:03,705 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:03,723 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-02-06 03:48:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:48:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-06 03:48:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:03,729 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:48:03,729 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:48:03,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-02-06 03:48:03,736 INFO L435 NwaCegarLoop]: 159 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, 159 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-02-06 03:48:03,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:48:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:48:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:48:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-02-06 03:48:03,769 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-02-06 03:48:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:03,770 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-02-06 03:48:03,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-02-06 03:48:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:48:03,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:03,772 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:03,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:48:03,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:48:03,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:03,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash 33117330, now seen corresponding path program 1 times [2025-02-06 03:48:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:03,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112454521] [2025-02-06 03:48:03,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:04,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:48:04,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:48:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:48:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112454521] [2025-02-06 03:48:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112454521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569747258] [2025-02-06 03:48:04,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:04,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:04,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:04,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:04,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:48:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:48:04,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:48:04,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:04,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:04,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:48:04,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:04,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569747258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:48:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760148039] [2025-02-06 03:48:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:04,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:04,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:04,639 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:04,675 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-02-06 03:48:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:48:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:04,676 INFO L225 Difference]: With dead ends: 215 [2025-02-06 03:48:04,676 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 03:48:04,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:04,679 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:04,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 03:48:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 03:48:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:48:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-02-06 03:48:04,688 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-02-06 03:48:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:04,689 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-02-06 03:48:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-02-06 03:48:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:48:04,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:04,692 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:04,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:48:04,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:04,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1999942735, now seen corresponding path program 1 times [2025-02-06 03:48:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240046445] [2025-02-06 03:48:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:04,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:48:04,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:48:04,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:04,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:05,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240046445] [2025-02-06 03:48:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240046445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:05,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961287655] [2025-02-06 03:48:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:05,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:05,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:05,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:05,288 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:05,500 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2025-02-06 03:48:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:48:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-02-06 03:48:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:05,502 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:48:05,502 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:48:05,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:05,503 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 95 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:05,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 412 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:48:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2025-02-06 03:48:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:48:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2025-02-06 03:48:05,510 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 133 [2025-02-06 03:48:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:05,510 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2025-02-06 03:48:05,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2025-02-06 03:48:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:48:05,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:05,513 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:05,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:48:05,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -941714864, now seen corresponding path program 1 times [2025-02-06 03:48:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610337691] [2025-02-06 03:48:05,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:05,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:48:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:48:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610337691] [2025-02-06 03:48:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610337691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862806525] [2025-02-06 03:48:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:06,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:06,854 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:07,085 INFO L93 Difference]: Finished difference Result 271 states and 397 transitions. [2025-02-06 03:48:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-02-06 03:48:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:07,087 INFO L225 Difference]: With dead ends: 271 [2025-02-06 03:48:07,087 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 03:48:07,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:07,088 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 104 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:07,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 427 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 03:48:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-02-06 03:48:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.4134615384615385) internal successors, (147), 104 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:48:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2025-02-06 03:48:07,102 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 133 [2025-02-06 03:48:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2025-02-06 03:48:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2025-02-06 03:48:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:07,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:07,104 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:48:07,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:07,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1572746037, now seen corresponding path program 1 times [2025-02-06 03:48:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003912711] [2025-02-06 03:48:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:07,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003912711] [2025-02-06 03:48:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003912711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:07,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507791914] [2025-02-06 03:48:07,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:07,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:07,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:07,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:07,454 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:07,691 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2025-02-06 03:48:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-02-06 03:48:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:07,695 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:48:07,695 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 03:48:07,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:07,696 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:07,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 647 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 03:48:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2025-02-06 03:48:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.4049079754601228) internal successors, (229), 164 states have internal predecessors, (229), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:48:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 269 transitions. [2025-02-06 03:48:07,713 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 269 transitions. Word has length 134 [2025-02-06 03:48:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:07,714 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 269 transitions. [2025-02-06 03:48:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2025-02-06 03:48:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:07,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:07,715 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:48:07,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1769259542, now seen corresponding path program 1 times [2025-02-06 03:48:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245479150] [2025-02-06 03:48:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:07,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:07,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:07,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:07,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245479150] [2025-02-06 03:48:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245479150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:48:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610513116] [2025-02-06 03:48:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:08,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:48:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:08,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:48:08,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:08,857 INFO L87 Difference]: Start difference. First operand 186 states and 269 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:09,661 INFO L93 Difference]: Finished difference Result 620 states and 898 transitions. [2025-02-06 03:48:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:48:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-06 03:48:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:09,665 INFO L225 Difference]: With dead ends: 620 [2025-02-06 03:48:09,666 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 03:48:09,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:48:09,668 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 258 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:09,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 863 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:48:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 03:48:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2025-02-06 03:48:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 383 states have (on average 1.4073107049608355) internal successors, (539), 386 states have internal predecessors, (539), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:48:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 623 transitions. [2025-02-06 03:48:09,701 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 623 transitions. Word has length 134 [2025-02-06 03:48:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:09,701 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 623 transitions. [2025-02-06 03:48:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 623 transitions. [2025-02-06 03:48:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:09,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:09,702 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:48:09,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570262, now seen corresponding path program 1 times [2025-02-06 03:48:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663593511] [2025-02-06 03:48:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:09,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663593511] [2025-02-06 03:48:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663593511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:48:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127941633] [2025-02-06 03:48:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:48:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:10,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:48:10,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:10,557 INFO L87 Difference]: Start difference. First operand 431 states and 623 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:11,274 INFO L93 Difference]: Finished difference Result 695 states and 993 transitions. [2025-02-06 03:48:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:48:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-06 03:48:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:11,276 INFO L225 Difference]: With dead ends: 695 [2025-02-06 03:48:11,276 INFO L226 Difference]: Without dead ends: 450 [2025-02-06 03:48:11,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:11,277 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 278 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:11,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 781 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:48:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-06 03:48:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2025-02-06 03:48:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 392 states have (on average 1.3954081632653061) internal successors, (547), 396 states have internal predecessors, (547), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:48:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 635 transitions. [2025-02-06 03:48:11,305 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 635 transitions. Word has length 134 [2025-02-06 03:48:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:11,305 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 635 transitions. [2025-02-06 03:48:11,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 635 transitions. [2025-02-06 03:48:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:11,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:11,307 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:48:11,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2116883529, now seen corresponding path program 1 times [2025-02-06 03:48:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-02-06 03:48:11,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:11,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:11,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:11,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:11,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-02-06 03:48:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697074544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973290167] [2025-02-06 03:48:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:11,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:11,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:11,492 INFO L87 Difference]: Start difference. First operand 444 states and 635 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:11,825 INFO L93 Difference]: Finished difference Result 1008 states and 1453 transitions. [2025-02-06 03:48:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:11,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-02-06 03:48:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:11,830 INFO L225 Difference]: With dead ends: 1008 [2025-02-06 03:48:11,830 INFO L226 Difference]: Without dead ends: 576 [2025-02-06 03:48:11,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:11,831 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 135 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:11,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 982 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-02-06 03:48:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 544. [2025-02-06 03:48:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 467 states have (on average 1.3832976445396146) internal successors, (646), 471 states have internal predecessors, (646), 67 states have call successors, (67), 9 states have call predecessors, (67), 9 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:48:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 780 transitions. [2025-02-06 03:48:11,860 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 780 transitions. Word has length 134 [2025-02-06 03:48:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 780 transitions. [2025-02-06 03:48:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 780 transitions. [2025-02-06 03:48:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:11,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:11,866 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:48:11,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash 516445675, now seen corresponding path program 1 times [2025-02-06 03:48:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497934814] [2025-02-06 03:48:11,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:11,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:11,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:11,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:11,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497934814] [2025-02-06 03:48:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497934814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:12,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651352653] [2025-02-06 03:48:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:12,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:12,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:12,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:12,531 INFO L87 Difference]: Start difference. First operand 544 states and 780 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:12,724 INFO L93 Difference]: Finished difference Result 1520 states and 2178 transitions. [2025-02-06 03:48:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:12,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-02-06 03:48:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:12,732 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 03:48:12,732 INFO L226 Difference]: Without dead ends: 994 [2025-02-06 03:48:12,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-02-06 03:48:12,736 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 86 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:12,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 273 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-02-06 03:48:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988. [2025-02-06 03:48:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 841 states have (on average 1.3674197384066586) internal successors, (1150), 848 states have internal predecessors, (1150), 129 states have call successors, (129), 17 states have call predecessors, (129), 17 states have return successors, (129), 122 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-06 03:48:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1408 transitions. [2025-02-06 03:48:12,786 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1408 transitions. Word has length 134 [2025-02-06 03:48:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:12,786 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1408 transitions. [2025-02-06 03:48:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1408 transitions. [2025-02-06 03:48:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:12,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:12,789 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:12,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:48:12,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1557908629, now seen corresponding path program 1 times [2025-02-06 03:48:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315099175] [2025-02-06 03:48:12,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:12,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315099175] [2025-02-06 03:48:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315099175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515953792] [2025-02-06 03:48:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:13,329 INFO L87 Difference]: Start difference. First operand 988 states and 1408 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:13,556 INFO L93 Difference]: Finished difference Result 1920 states and 2739 transitions. [2025-02-06 03:48:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:13,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-02-06 03:48:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:13,561 INFO L225 Difference]: With dead ends: 1920 [2025-02-06 03:48:13,561 INFO L226 Difference]: Without dead ends: 950 [2025-02-06 03:48:13,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02-06 03:48:13,563 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 94 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:13,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 275 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-02-06 03:48:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 944. [2025-02-06 03:48:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 799 states have (on average 1.3642052565707135) internal successors, (1090), 805 states have internal predecessors, (1090), 127 states have call successors, (127), 17 states have call predecessors, (127), 17 states have return successors, (127), 121 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 03:48:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1344 transitions. [2025-02-06 03:48:13,611 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1344 transitions. Word has length 134 [2025-02-06 03:48:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1344 transitions. [2025-02-06 03:48:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1344 transitions. [2025-02-06 03:48:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:13,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:13,615 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:13,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:48:13,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:13,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 448498411, now seen corresponding path program 1 times [2025-02-06 03:48:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708281317] [2025-02-06 03:48:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:13,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:13,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708281317] [2025-02-06 03:48:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708281317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:14,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:14,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:48:14,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318185228] [2025-02-06 03:48:14,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:14,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:48:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:14,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:48:14,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:14,707 INFO L87 Difference]: Start difference. First operand 944 states and 1344 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:15,384 INFO L93 Difference]: Finished difference Result 1940 states and 2758 transitions. [2025-02-06 03:48:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:48:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-06 03:48:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:15,389 INFO L225 Difference]: With dead ends: 1940 [2025-02-06 03:48:15,389 INFO L226 Difference]: Without dead ends: 1014 [2025-02-06 03:48:15,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:15,391 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 257 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:15,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 647 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:48:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-06 03:48:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1005. [2025-02-06 03:48:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 856 states have (on average 1.3656542056074767) internal successors, (1169), 863 states have internal predecessors, (1169), 129 states have call successors, (129), 19 states have call predecessors, (129), 19 states have return successors, (129), 122 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-06 03:48:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1427 transitions. [2025-02-06 03:48:15,441 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1427 transitions. Word has length 134 [2025-02-06 03:48:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:15,442 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1427 transitions. [2025-02-06 03:48:15,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1427 transitions. [2025-02-06 03:48:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:48:15,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:15,444 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:15,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:48:15,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:15,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 236187691, now seen corresponding path program 1 times [2025-02-06 03:48:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:15,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166694] [2025-02-06 03:48:15,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:15,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:48:15,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:48:15,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:15,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166694] [2025-02-06 03:48:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:48:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266370495] [2025-02-06 03:48:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:48:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:16,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:48:16,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:16,403 INFO L87 Difference]: Start difference. First operand 1005 states and 1427 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:17,200 INFO L93 Difference]: Finished difference Result 2003 states and 2838 transitions. [2025-02-06 03:48:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:48:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-06 03:48:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:17,207 INFO L225 Difference]: With dead ends: 2003 [2025-02-06 03:48:17,207 INFO L226 Difference]: Without dead ends: 1016 [2025-02-06 03:48:17,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:17,210 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 170 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:17,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 778 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:48:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-06 03:48:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 657. [2025-02-06 03:48:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 560 states have (on average 1.3517857142857144) internal successors, (757), 564 states have internal predecessors, (757), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:48:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 921 transitions. [2025-02-06 03:48:17,249 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 921 transitions. Word has length 134 [2025-02-06 03:48:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:17,251 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 921 transitions. [2025-02-06 03:48:17,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 921 transitions. [2025-02-06 03:48:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:48:17,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:17,254 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:17,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:48:17,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1140507278, now seen corresponding path program 1 times [2025-02-06 03:48:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469532325] [2025-02-06 03:48:17,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:17,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:48:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:48:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469532325] [2025-02-06 03:48:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469532325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:48:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036414126] [2025-02-06 03:48:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:17,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:48:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:17,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:48:17,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:48:17,355 INFO L87 Difference]: Start difference. First operand 657 states and 921 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:17,387 INFO L93 Difference]: Finished difference Result 953 states and 1344 transitions. [2025-02-06 03:48:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:48:17,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-02-06 03:48:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:17,390 INFO L225 Difference]: With dead ends: 953 [2025-02-06 03:48:17,390 INFO L226 Difference]: Without dead ends: 657 [2025-02-06 03:48:17,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:48:17,392 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:17,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-06 03:48:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2025-02-06 03:48:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 560 states have (on average 1.35) internal successors, (756), 564 states have internal predecessors, (756), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:48:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 920 transitions. [2025-02-06 03:48:17,429 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 920 transitions. Word has length 135 [2025-02-06 03:48:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 920 transitions. [2025-02-06 03:48:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 920 transitions. [2025-02-06 03:48:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:48:17,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:17,432 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:48:17,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 104257203, now seen corresponding path program 1 times [2025-02-06 03:48:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351905101] [2025-02-06 03:48:17,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:48:17,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:48:17,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:17,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351905101] [2025-02-06 03:48:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351905101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:17,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:17,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:48:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426767147] [2025-02-06 03:48:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:17,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:48:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:17,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:48:17,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:17,990 INFO L87 Difference]: Start difference. First operand 657 states and 920 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:18,930 INFO L93 Difference]: Finished difference Result 1504 states and 2119 transitions. [2025-02-06 03:48:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:48:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-02-06 03:48:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:18,934 INFO L225 Difference]: With dead ends: 1504 [2025-02-06 03:48:18,935 INFO L226 Difference]: Without dead ends: 1208 [2025-02-06 03:48:18,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:48:18,936 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 269 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:18,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1573 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:48:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-02-06 03:48:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 943. [2025-02-06 03:48:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 809 states have (on average 1.3609394313967862) internal successors, (1101), 815 states have internal predecessors, (1101), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-06 03:48:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1329 transitions. [2025-02-06 03:48:18,978 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1329 transitions. Word has length 135 [2025-02-06 03:48:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:18,978 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1329 transitions. [2025-02-06 03:48:18,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1329 transitions. [2025-02-06 03:48:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:48:18,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:18,979 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:18,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:48:18,980 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 135277010, now seen corresponding path program 1 times [2025-02-06 03:48:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521106362] [2025-02-06 03:48:18,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:19,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:48:19,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:48:19,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:19,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521106362] [2025-02-06 03:48:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521106362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082587244] [2025-02-06 03:48:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:19,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:19,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:19,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:19,646 INFO L87 Difference]: Start difference. First operand 943 states and 1329 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:20,497 INFO L93 Difference]: Finished difference Result 1472 states and 2078 transitions. [2025-02-06 03:48:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:48:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-02-06 03:48:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:20,502 INFO L225 Difference]: With dead ends: 1472 [2025-02-06 03:48:20,502 INFO L226 Difference]: Without dead ends: 890 [2025-02-06 03:48:20,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:48:20,504 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 352 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:20,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 977 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:48:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-02-06 03:48:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 880. [2025-02-06 03:48:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 749 states have (on average 1.3457943925233644) internal successors, (1008), 753 states have internal predecessors, (1008), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:48:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1232 transitions. [2025-02-06 03:48:20,539 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1232 transitions. Word has length 135 [2025-02-06 03:48:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1232 transitions. [2025-02-06 03:48:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1232 transitions. [2025-02-06 03:48:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:48:20,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:20,542 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:20,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:48:20,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -273547215, now seen corresponding path program 1 times [2025-02-06 03:48:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:20,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388131757] [2025-02-06 03:48:20,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:20,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:48:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:48:20,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:20,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388131757] [2025-02-06 03:48:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388131757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:21,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:48:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837291605] [2025-02-06 03:48:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:48:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:21,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:48:21,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:21,367 INFO L87 Difference]: Start difference. First operand 880 states and 1232 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:22,283 INFO L93 Difference]: Finished difference Result 1412 states and 1977 transitions. [2025-02-06 03:48:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:48:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-02-06 03:48:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:22,287 INFO L225 Difference]: With dead ends: 1412 [2025-02-06 03:48:22,287 INFO L226 Difference]: Without dead ends: 893 [2025-02-06 03:48:22,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:48:22,289 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 227 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:22,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1366 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:48:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-06 03:48:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 878. [2025-02-06 03:48:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 747 states have (on average 1.3453815261044177) internal successors, (1005), 751 states have internal predecessors, (1005), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:48:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1229 transitions. [2025-02-06 03:48:22,319 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1229 transitions. Word has length 135 [2025-02-06 03:48:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:22,320 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1229 transitions. [2025-02-06 03:48:22,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1229 transitions. [2025-02-06 03:48:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:48:22,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:22,321 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:48:22,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1418158616, now seen corresponding path program 1 times [2025-02-06 03:48:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723558754] [2025-02-06 03:48:22,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:48:22,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:48:22,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:22,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:22,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723558754] [2025-02-06 03:48:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723558754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:22,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758042458] [2025-02-06 03:48:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:22,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:22,580 INFO L87 Difference]: Start difference. First operand 878 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:23,223 INFO L93 Difference]: Finished difference Result 1167 states and 1635 transitions. [2025-02-06 03:48:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:48:23,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-02-06 03:48:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:23,226 INFO L225 Difference]: With dead ends: 1167 [2025-02-06 03:48:23,226 INFO L226 Difference]: Without dead ends: 879 [2025-02-06 03:48:23,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:48:23,227 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 257 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:23,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1088 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:48:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-06 03:48:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 873. [2025-02-06 03:48:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 742 states have (on average 1.3423180592991915) internal successors, (996), 746 states have internal predecessors, (996), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:48:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1220 transitions. [2025-02-06 03:48:23,257 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1220 transitions. Word has length 136 [2025-02-06 03:48:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:23,257 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1220 transitions. [2025-02-06 03:48:23,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1220 transitions. [2025-02-06 03:48:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:48:23,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:23,259 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:23,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:48:23,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 802454376, now seen corresponding path program 1 times [2025-02-06 03:48:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587993662] [2025-02-06 03:48:23,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:48:23,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:48:23,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:23,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587993662] [2025-02-06 03:48:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587993662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009228383] [2025-02-06 03:48:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:23,481 INFO L87 Difference]: Start difference. First operand 873 states and 1220 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:24,084 INFO L93 Difference]: Finished difference Result 1107 states and 1545 transitions. [2025-02-06 03:48:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:48:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-02-06 03:48:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:24,088 INFO L225 Difference]: With dead ends: 1107 [2025-02-06 03:48:24,088 INFO L226 Difference]: Without dead ends: 824 [2025-02-06 03:48:24,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:48:24,089 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 243 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:24,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1152 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:48:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-06 03:48:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 617. [2025-02-06 03:48:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 523 states have (on average 1.338432122370937) internal successors, (700), 525 states have internal predecessors, (700), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 860 transitions. [2025-02-06 03:48:24,134 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 860 transitions. Word has length 136 [2025-02-06 03:48:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:24,135 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 860 transitions. [2025-02-06 03:48:24,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 860 transitions. [2025-02-06 03:48:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:48:24,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:24,137 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:24,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:48:24,137 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:24,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1764068393, now seen corresponding path program 1 times [2025-02-06 03:48:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:24,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490733853] [2025-02-06 03:48:24,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:24,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:24,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:48:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:48:24,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:24,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490733853] [2025-02-06 03:48:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490733853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966305117] [2025-02-06 03:48:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:24,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:24,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:24,619 INFO L87 Difference]: Start difference. First operand 617 states and 860 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:24,857 INFO L93 Difference]: Finished difference Result 1308 states and 1817 transitions. [2025-02-06 03:48:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-06 03:48:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:24,861 INFO L225 Difference]: With dead ends: 1308 [2025-02-06 03:48:24,861 INFO L226 Difference]: Without dead ends: 694 [2025-02-06 03:48:24,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:24,863 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:24,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 578 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-02-06 03:48:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 605. [2025-02-06 03:48:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 511 states have (on average 1.3111545988258317) internal successors, (670), 513 states have internal predecessors, (670), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 830 transitions. [2025-02-06 03:48:24,886 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 830 transitions. Word has length 136 [2025-02-06 03:48:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 830 transitions. [2025-02-06 03:48:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:48:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 830 transitions. [2025-02-06 03:48:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:48:24,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:24,888 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:24,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:48:24,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:24,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 766996040, now seen corresponding path program 1 times [2025-02-06 03:48:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871617650] [2025-02-06 03:48:24,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:48:24,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:48:24,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:24,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871617650] [2025-02-06 03:48:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871617650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907553526] [2025-02-06 03:48:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:25,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:25,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:25,016 INFO L87 Difference]: Start difference. First operand 605 states and 830 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:25,160 INFO L93 Difference]: Finished difference Result 1143 states and 1568 transitions. [2025-02-06 03:48:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:48:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-02-06 03:48:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:25,163 INFO L225 Difference]: With dead ends: 1143 [2025-02-06 03:48:25,163 INFO L226 Difference]: Without dead ends: 694 [2025-02-06 03:48:25,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:25,164 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 49 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:25,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 478 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:48:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-02-06 03:48:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 605. [2025-02-06 03:48:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 511 states have (on average 1.3052837573385518) internal successors, (667), 513 states have internal predecessors, (667), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 827 transitions. [2025-02-06 03:48:25,190 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 827 transitions. Word has length 136 [2025-02-06 03:48:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 827 transitions. [2025-02-06 03:48:25,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 827 transitions. [2025-02-06 03:48:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:48:25,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:25,192 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:48:25,193 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2077686251, now seen corresponding path program 1 times [2025-02-06 03:48:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651465621] [2025-02-06 03:48:25,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:48:25,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:48:25,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:25,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651465621] [2025-02-06 03:48:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651465621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445931878] [2025-02-06 03:48:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:25,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:25,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:25,457 INFO L87 Difference]: Start difference. First operand 605 states and 827 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:25,781 INFO L93 Difference]: Finished difference Result 1052 states and 1437 transitions. [2025-02-06 03:48:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:25,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-02-06 03:48:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:25,785 INFO L225 Difference]: With dead ends: 1052 [2025-02-06 03:48:25,785 INFO L226 Difference]: Without dead ends: 603 [2025-02-06 03:48:25,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:25,786 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 213 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:25,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 678 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-06 03:48:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2025-02-06 03:48:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 503 states have (on average 1.2982107355864811) internal successors, (653), 505 states have internal predecessors, (653), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 813 transitions. [2025-02-06 03:48:25,808 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 813 transitions. Word has length 138 [2025-02-06 03:48:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 813 transitions. [2025-02-06 03:48:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 813 transitions. [2025-02-06 03:48:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:48:25,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:25,810 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:48:25,810 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1929420157, now seen corresponding path program 1 times [2025-02-06 03:48:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798191075] [2025-02-06 03:48:25,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:25,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:48:25,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:48:25,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:25,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798191075] [2025-02-06 03:48:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798191075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:25,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328365379] [2025-02-06 03:48:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:25,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:25,934 INFO L87 Difference]: Start difference. First operand 597 states and 813 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:26,027 INFO L93 Difference]: Finished difference Result 1179 states and 1605 transitions. [2025-02-06 03:48:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-02-06 03:48:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:26,030 INFO L225 Difference]: With dead ends: 1179 [2025-02-06 03:48:26,031 INFO L226 Difference]: Without dead ends: 585 [2025-02-06 03:48:26,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:26,033 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:26,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:48:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-06 03:48:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-02-06 03:48:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 491 states have (on average 1.2810590631364562) internal successors, (629), 493 states have internal predecessors, (629), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 789 transitions. [2025-02-06 03:48:26,057 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 789 transitions. Word has length 139 [2025-02-06 03:48:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:26,058 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 789 transitions. [2025-02-06 03:48:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 789 transitions. [2025-02-06 03:48:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:48:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:26,059 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:48:26,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 669259499, now seen corresponding path program 1 times [2025-02-06 03:48:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442468931] [2025-02-06 03:48:26,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:26,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:48:26,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:48:26,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:26,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:48:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442468931] [2025-02-06 03:48:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442468931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634370707] [2025-02-06 03:48:26,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:26,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:48:26,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:48:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:48:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:26,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:48:26,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:26,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634370707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:26,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:48:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795748537] [2025-02-06 03:48:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:26,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:26,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:26,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:26,441 INFO L87 Difference]: Start difference. First operand 585 states and 789 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:26,492 INFO L93 Difference]: Finished difference Result 1191 states and 1605 transitions. [2025-02-06 03:48:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:26,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-02-06 03:48:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:26,495 INFO L225 Difference]: With dead ends: 1191 [2025-02-06 03:48:26,495 INFO L226 Difference]: Without dead ends: 609 [2025-02-06 03:48:26,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:26,497 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:26,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 702 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-06 03:48:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-02-06 03:48:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 515 states have (on average 1.2679611650485436) internal successors, (653), 517 states have internal predecessors, (653), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:48:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 813 transitions. [2025-02-06 03:48:26,524 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 813 transitions. Word has length 139 [2025-02-06 03:48:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:26,524 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 813 transitions. [2025-02-06 03:48:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 813 transitions. [2025-02-06 03:48:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:26,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:26,525 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:26,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:48:26,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:26,726 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:26,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2093619223, now seen corresponding path program 1 times [2025-02-06 03:48:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205920283] [2025-02-06 03:48:26,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:26,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:26,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:26,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:26,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205920283] [2025-02-06 03:48:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205920283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020581044] [2025-02-06 03:48:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:26,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:26,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:26,992 INFO L87 Difference]: Start difference. First operand 609 states and 813 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:27,446 INFO L93 Difference]: Finished difference Result 1097 states and 1444 transitions. [2025-02-06 03:48:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-02-06 03:48:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:27,449 INFO L225 Difference]: With dead ends: 1097 [2025-02-06 03:48:27,449 INFO L226 Difference]: Without dead ends: 766 [2025-02-06 03:48:27,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:27,450 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 198 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:27,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 716 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-06 03:48:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 759. [2025-02-06 03:48:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 637 states have (on average 1.23861852433281) internal successors, (789), 642 states have internal predecessors, (789), 101 states have call successors, (101), 20 states have call predecessors, (101), 20 states have return successors, (101), 96 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-06 03:48:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 991 transitions. [2025-02-06 03:48:27,481 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 991 transitions. Word has length 141 [2025-02-06 03:48:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 991 transitions. [2025-02-06 03:48:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 991 transitions. [2025-02-06 03:48:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:27,483 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:48:27,483 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 191244232, now seen corresponding path program 1 times [2025-02-06 03:48:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453425761] [2025-02-06 03:48:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:27,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:27,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:27,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:27,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453425761] [2025-02-06 03:48:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453425761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:28,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90319122] [2025-02-06 03:48:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:28,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:28,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:28,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:28,125 INFO L87 Difference]: Start difference. First operand 759 states and 991 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:28,668 INFO L93 Difference]: Finished difference Result 1659 states and 2150 transitions. [2025-02-06 03:48:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-02-06 03:48:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:28,672 INFO L225 Difference]: With dead ends: 1659 [2025-02-06 03:48:28,672 INFO L226 Difference]: Without dead ends: 903 [2025-02-06 03:48:28,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:28,674 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 152 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:28,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 563 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:48:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-02-06 03:48:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 897. [2025-02-06 03:48:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 750 states have (on average 1.22) internal successors, (915), 758 states have internal predecessors, (915), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:48:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1155 transitions. [2025-02-06 03:48:28,736 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1155 transitions. Word has length 141 [2025-02-06 03:48:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1155 transitions. [2025-02-06 03:48:28,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1155 transitions. [2025-02-06 03:48:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:48:28,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:28,738 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:48:28,740 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1667341731, now seen corresponding path program 1 times [2025-02-06 03:48:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504616099] [2025-02-06 03:48:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:28,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:48:28,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:48:28,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:28,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:48:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504616099] [2025-02-06 03:48:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504616099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:48:29,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191208038] [2025-02-06 03:48:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:29,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:48:29,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:29,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:48:29,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:29,013 INFO L87 Difference]: Start difference. First operand 897 states and 1155 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:29,328 INFO L93 Difference]: Finished difference Result 934 states and 1199 transitions. [2025-02-06 03:48:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:48:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-02-06 03:48:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:29,331 INFO L225 Difference]: With dead ends: 934 [2025-02-06 03:48:29,331 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 03:48:29,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:48:29,332 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 110 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:29,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1000 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 03:48:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 930. [2025-02-06 03:48:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 783 states have (on average 1.206896551724138) internal successors, (945), 791 states have internal predecessors, (945), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:48:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1185 transitions. [2025-02-06 03:48:29,366 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1185 transitions. Word has length 142 [2025-02-06 03:48:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:29,366 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1185 transitions. [2025-02-06 03:48:29,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:48:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1185 transitions. [2025-02-06 03:48:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:48:29,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:29,367 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:48:29,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:48:29,367 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:29,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 443948638, now seen corresponding path program 1 times [2025-02-06 03:48:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857027363] [2025-02-06 03:48:29,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:29,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:48:29,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:48:29,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:29,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:48:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371007067] [2025-02-06 03:48:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:29,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:29,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:29,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:48:29,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:48:29,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:48:29,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:29,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 03:48:29,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:29,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2025-02-06 03:48:30,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 114 [2025-02-06 03:48:30,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 114 [2025-02-06 03:48:32,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 128 [2025-02-06 03:48:33,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 131 [2025-02-06 03:48:34,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 03:48:36,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 03:48:37,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 03:48:38,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 03:48:38,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 03:48:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-06 03:48:40,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:48:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857027363] [2025-02-06 03:48:49,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:48:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371007067] [2025-02-06 03:48:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371007067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:49,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-06 03:48:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246463693] [2025-02-06 03:48:49,694 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:48:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:48:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:49,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:48:49,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:48:49,695 INFO L87 Difference]: Start difference. First operand 930 states and 1185 transitions. Second operand has 11 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 03:49:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:05,352 INFO L93 Difference]: Finished difference Result 2032 states and 2583 transitions. [2025-02-06 03:49:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:49:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 142 [2025-02-06 03:49:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:05,357 INFO L225 Difference]: With dead ends: 2032 [2025-02-06 03:49:05,357 INFO L226 Difference]: Without dead ends: 1105 [2025-02-06 03:49:05,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 239 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:49:05,359 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 74 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:05,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 557 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2025-02-06 03:49:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2025-02-06 03:49:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1053. [2025-02-06 03:49:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 884 states have (on average 1.2070135746606334) internal successors, (1067), 893 states have internal predecessors, (1067), 137 states have call successors, (137), 31 states have call predecessors, (137), 31 states have return successors, (137), 128 states have call predecessors, (137), 137 states have call successors, (137) [2025-02-06 03:49:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1341 transitions. [2025-02-06 03:49:05,418 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1341 transitions. Word has length 142 [2025-02-06 03:49:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1341 transitions. [2025-02-06 03:49:05,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 03:49:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1341 transitions. [2025-02-06 03:49:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:49:05,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:05,420 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:05,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:49:05,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 03:49:05,621 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:05,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -807860260, now seen corresponding path program 1 times [2025-02-06 03:49:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:05,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333424402] [2025-02-06 03:49:05,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:05,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:49:05,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:49:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:49:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375095002] [2025-02-06 03:49:05,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:05,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:05,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:49:05,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:49:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:49:06,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:49:06,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:06,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:06,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:49:06,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:49:06,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:49:06,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:06,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:06,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:49:06,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:49:06,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:49:06,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:49:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 03:49:06,759 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:06,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:49:06,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:49:06 BoogieIcfgContainer [2025-02-06 03:49:06,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:49:06,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:49:06,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:49:06,804 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:49:06,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:03" (3/4) ... [2025-02-06 03:49:06,806 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:49:06,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:49:06,807 INFO L158 Benchmark]: Toolchain (without parser) took 64554.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.6MB in the beginning and 49.5MB in the end (delta: 83.1MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2025-02-06 03:49:06,807 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:06,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.94ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:49:06,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.57ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:06,807 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 110.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:49:06,807 INFO L158 Benchmark]: IcfgBuilder took 512.05ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 78.2MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:49:06,808 INFO L158 Benchmark]: TraceAbstraction took 63756.38ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.4MB in the beginning and 49.5MB in the end (delta: 27.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-02-06 03:49:06,808 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 201.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:06,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.94ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.57ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 110.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 512.05ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 78.2MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63756.38ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.4MB in the beginning and 49.5MB in the end (delta: 27.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 201.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L78] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] RET updateVariables() [L115] CALL step() [L56] EXPR WrapperStruct00.var_1_12 [L56] EXPR WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_14 [L56] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L56] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L56] COND FALSE !(((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_1 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_11 [L62] EXPR WrapperStruct00.var_1_6 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND FALSE !((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) [L65] WrapperStruct00.var_1_5 = 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR WrapperStruct00.var_1_11 [L67] unsigned char stepLocal_1 = WrapperStruct00.var_1_11; [L68] EXPR WrapperStruct00.var_1_2 [L68] unsigned char stepLocal_0 = WrapperStruct00.var_1_2; [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_11 [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L69] COND TRUE stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L70] EXPR WrapperStruct00.var_1_9 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L70] COND FALSE !(stepLocal_1 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_13 [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106-L107] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.7s, OverallIterations: 28, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3752 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3745 mSDsluCounter, 18807 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14073 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12401 IncrementalHoareTripleChecker+Invalid, 12910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 4734 mSDtfsCounter, 12401 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 825 SyntacticMatches, 6 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=27, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 1247 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 4493 NumberOfCodeBlocks, 4493 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4037 ConstructedInterpolants, 0 QuantifiedInterpolants, 26511 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1939 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12200/12600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:49:07,018 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-06 03:49:07,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:08,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:08,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:49:08,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:08,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:09,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:09,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:09,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:09,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:09,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:09,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:09,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:09,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:09,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:09,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:09,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:09,015 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:49:09,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:49:09,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:09,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:09,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:09,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:09,016 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-jdk21/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 -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-02-06 03:49:09,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:09,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:09,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:09,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:09,280 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:09,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:49:10,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acf6889c8/bbd0f8ef029c474587afa486c444c211/FLAGd840654e4 [2025-02-06 03:49:10,669 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:10,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:49:10,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acf6889c8/bbd0f8ef029c474587afa486c444c211/FLAGd840654e4 [2025-02-06 03:49:10,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acf6889c8/bbd0f8ef029c474587afa486c444c211 [2025-02-06 03:49:10,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:10,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:10,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:10,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:10,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:10,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:10,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161ce23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10, skipping insertion in model container [2025-02-06 03:49:10,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:10,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:10,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-02-06 03:49:10,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:10,893 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:10,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2025-02-06 03:49:10,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:10,972 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:10,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10 WrapperNode [2025-02-06 03:49:10,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:10,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:10,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:10,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:10,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:10,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,017 INFO L138 Inliner]: procedures = 34, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-02-06 03:49:11,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:11,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:11,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:11,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:11,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,054 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-02-06 03:49:11,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:11,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:11,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:11,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:11,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (1/1) ... [2025-02-06 03:49:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:11,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:49:11,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:49:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:11,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:11,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:49:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:49:11,228 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:11,230 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:21,313 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-02-06 03:49:21,334 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:21,334 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:21,341 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:21,341 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:21,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:21 BoogieIcfgContainer [2025-02-06 03:49:21,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:21,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:21,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:21,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:21,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:10" (1/3) ... [2025-02-06 03:49:21,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4390fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:21, skipping insertion in model container [2025-02-06 03:49:21,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:10" (2/3) ... [2025-02-06 03:49:21,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4390fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:21, skipping insertion in model container [2025-02-06 03:49:21,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:21" (3/3) ... [2025-02-06 03:49:21,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-02-06 03:49:21,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:21,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:21,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:21,413 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;@78d11ac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:21,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:49:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:21,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:21,436 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:21,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:21,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1943675930, now seen corresponding path program 1 times [2025-02-06 03:49:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572832435] [2025-02-06 03:49:21,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:21,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:21,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:49:21,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:49:21,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:21,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:21,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:21,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:21,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:21,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:49:21,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:21,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572832435] [2025-02-06 03:49:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572832435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:21,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:49:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232957568] [2025-02-06 03:49:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:21,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:21,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:21,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:21,948 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:49:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:21,972 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-02-06 03:49:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:21,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-06 03:49:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:21,977 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:49:21,977 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:49:21,979 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-02-06 03:49:21,981 INFO L435 NwaCegarLoop]: 159 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, 159 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-02-06 03:49:21,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:49:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:49:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:49:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-02-06 03:49:22,009 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-02-06 03:49:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:22,009 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-02-06 03:49:22,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:49:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-02-06 03:49:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:49:22,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:22,011 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:22,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:49:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:22,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1726341499, now seen corresponding path program 1 times [2025-02-06 03:49:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511796262] [2025-02-06 03:49:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:22,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:22,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:49:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:49:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:49:22,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:49:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:22,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:49:22,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:49:22,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:22,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511796262] [2025-02-06 03:49:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511796262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:49:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768102535] [2025-02-06 03:49:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:22,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:49:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:22,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:49:22,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:22,752 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:49:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:22,804 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-02-06 03:49:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:49:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:22,809 INFO L225 Difference]: With dead ends: 215 [2025-02-06 03:49:22,809 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 03:49:22,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:22,810 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:22,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 03:49:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 03:49:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:49:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-02-06 03:49:22,820 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-02-06 03:49:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:22,821 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-02-06 03:49:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:49:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-02-06 03:49:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:49:22,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:22,823 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:22,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:49:23,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:23,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1266681369, now seen corresponding path program 1 times [2025-02-06 03:49:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589237378] [2025-02-06 03:49:23,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:49:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:23,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:49:23,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:49:23,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:49:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:49:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:23,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:49:23,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:49:23,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:23,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589237378] [2025-02-06 03:49:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589237378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119192415] [2025-02-06 03:49:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:23,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:23,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:23,606 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)